./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.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_1_false-valid-memtrack.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 629d5a636c5f2810554fe722d7d0f8126d0f15df ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1_false-valid-memtrack.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 629d5a636c5f2810554fe722d7d0f8126d0f15df ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:05:59,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:05:59,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:05:59,988 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:05:59,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:05:59,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:05:59,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:05:59,997 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:06:00,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:06:00,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:06:00,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:06:00,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:06:00,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:06:00,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:06:00,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:06:00,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:06:00,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:06:00,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:06:00,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:06:00,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:06:00,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:06:00,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:06:00,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:06:00,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:06:00,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:06:00,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:06:00,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:06:00,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:06:00,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:06:00,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:06:00,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:06:00,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:06:00,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:06:00,048 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:06:00,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:06:00,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:06:00,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 23:06:00,076 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:06:00,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:06:00,078 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:06:00,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:06:00,080 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:06:00,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:06:00,080 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:06:00,081 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:06:00,081 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:06:00,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:06:00,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:06:00,082 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:06:00,082 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:06:00,082 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:06:00,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:06:00,083 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:06:00,083 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:06:00,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:06:00,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:06:00,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:06:00,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:06:00,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:06:00,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:06:00,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:06:00,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 23:06:00,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:06:00,086 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 -> 629d5a636c5f2810554fe722d7d0f8126d0f15df [2019-01-13 23:06:00,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:06:00,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:06:00,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:06:00,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:06:00,159 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:06:00,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:06:00,221 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78085062/5fa436962f1c43d0b536fb693bd4b634/FLAGdf7e5b4e4 [2019-01-13 23:06:00,737 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:06:00,738 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:06:00,762 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78085062/5fa436962f1c43d0b536fb693bd4b634/FLAGdf7e5b4e4 [2019-01-13 23:06:00,994 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78085062/5fa436962f1c43d0b536fb693bd4b634 [2019-01-13 23:06:00,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:06:01,000 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:06:01,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:06:01,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:06:01,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:06:01,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:06:00" (1/1) ... [2019-01-13 23:06:01,008 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 11:06:01, skipping insertion in model container [2019-01-13 23:06:01,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:06:00" (1/1) ... [2019-01-13 23:06:01,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:06:01,077 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:06:01,523 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:06:01,545 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:06:01,697 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:06:01,786 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:06:01,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01 WrapperNode [2019-01-13 23:06:01,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:06:01,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:06:01,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:06:01,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:06:01,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (1/1) ... [2019-01-13 23:06:01,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:06:01,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:06:01,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:06:01,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:06:01,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (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 23:06:01,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:06:01,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:06:01,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-13 23:06:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-13 23:06:01,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-13 23:06:01,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-13 23:06:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-13 23:06:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-13 23:06:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-13 23:06:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-13 23:06:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:06:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-13 23:06:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-13 23:06:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-13 23:06:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 23:06:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 23:06:01,983 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:06:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:06:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:06:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:06:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:06:01,984 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:06:01,985 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:06:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:06:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:06:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:06:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:06:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:06:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:06:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:06:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:06:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:06:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:06:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:06:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:06:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:06:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:06:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:06:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:06:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:06:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:06:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:06:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-13 23:06:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:06:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-13 23:06:02,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-13 23:06:02,004 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:06:02,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:06:02,004 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-13 23:06:02,004 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-13 23:06:02,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-13 23:06:02,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:06:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-13 23:06:02,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-13 23:06:02,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-13 23:06:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-13 23:06:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 23:06:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:06:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-13 23:06:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-13 23:06:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-13 23:06:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-13 23:06:02,720 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:06:03,600 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:06:04,475 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:06:04,475 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-13 23:06:04,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:06:04 BoogieIcfgContainer [2019-01-13 23:06:04,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:06:04,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:06:04,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:06:04,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:06:04,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:06:00" (1/3) ... [2019-01-13 23:06:04,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37057880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:06:04, skipping insertion in model container [2019-01-13 23:06:04,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:06:01" (2/3) ... [2019-01-13 23:06:04,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37057880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:06:04, skipping insertion in model container [2019-01-13 23:06:04,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:06:04" (3/3) ... [2019-01-13 23:06:04,485 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:06:04,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:06:04,504 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-13 23:06:04,521 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-13 23:06:04,546 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:06:04,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:06:04,547 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:06:04,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:06:04,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:06:04,548 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:06:04,548 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:06:04,548 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:06:04,548 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:06:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-13 23:06:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:06:04,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:04,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:04,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 688619389, now seen corresponding path program 1 times [2019-01-13 23:06:04,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:04,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:04,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:04,970 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 23:06:04,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:04,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:06:04,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:06:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:06:04,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:04,999 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2019-01-13 23:06:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:05,701 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2019-01-13 23:06:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:06:05,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 23:06:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:05,714 INFO L225 Difference]: With dead ends: 81 [2019-01-13 23:06:05,714 INFO L226 Difference]: Without dead ends: 78 [2019-01-13 23:06:05,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-13 23:06:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-01-13 23:06:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 23:06:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-13 23:06:05,765 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 16 [2019-01-13 23:06:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:05,766 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-13 23:06:05,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:06:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-13 23:06:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:06:05,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:05,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:05,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 688619390, now seen corresponding path program 1 times [2019-01-13 23:06:05,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:05,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:06,128 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 23:06:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:06,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:06:06,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:06:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:06:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:06:06,133 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 8 states. [2019-01-13 23:06:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:06,440 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-01-13 23:06:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:06:06,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 23:06:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:06,444 INFO L225 Difference]: With dead ends: 85 [2019-01-13 23:06:06,445 INFO L226 Difference]: Without dead ends: 85 [2019-01-13 23:06:06,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:06:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-13 23:06:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-01-13 23:06:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-13 23:06:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-01-13 23:06:06,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 16 [2019-01-13 23:06:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:06,459 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-01-13 23:06:06,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:06:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-01-13 23:06:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:06:06,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:06,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:06,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1576123070, now seen corresponding path program 1 times [2019-01-13 23:06:06,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:06,566 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 23:06:06,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:06,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:06:06,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:06:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:06:06,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:06,569 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 5 states. [2019-01-13 23:06:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:06,655 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-01-13 23:06:06,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:06:06,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 23:06:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:06,659 INFO L225 Difference]: With dead ends: 75 [2019-01-13 23:06:06,659 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 23:06:06,660 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 23:06:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 23:06:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-13 23:06:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 23:06:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-01-13 23:06:06,670 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2019-01-13 23:06:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:06,670 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-01-13 23:06:06,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:06:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-01-13 23:06:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:06:06,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:06,671 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 23:06:06,672 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -127651667, now seen corresponding path program 1 times [2019-01-13 23:06:06,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:06,778 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 23:06:06,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:06:06,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:06:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:06:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:06,780 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 5 states. [2019-01-13 23:06:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:06,804 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-01-13 23:06:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:06:06,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 23:06:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:06,806 INFO L225 Difference]: With dead ends: 75 [2019-01-13 23:06:06,806 INFO L226 Difference]: Without dead ends: 75 [2019-01-13 23:06:06,807 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 23:06:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-13 23:06:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-13 23:06:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 23:06:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-01-13 23:06:06,816 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2019-01-13 23:06:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:06,816 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-01-13 23:06:06,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:06:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-01-13 23:06:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:06:06,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:06,819 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 23:06:06,820 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1615158668, now seen corresponding path program 1 times [2019-01-13 23:06:06,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:06,905 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 23:06:06,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:06,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:06:06,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:06:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:06:06,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:06:06,909 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 3 states. [2019-01-13 23:06:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:07,215 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-01-13 23:06:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:06:07,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-13 23:06:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:07,218 INFO L225 Difference]: With dead ends: 111 [2019-01-13 23:06:07,218 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 23:06:07,219 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 23:06:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 23:06:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2019-01-13 23:06:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 23:06:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-01-13 23:06:07,227 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2019-01-13 23:06:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:07,228 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-01-13 23:06:07,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:06:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-01-13 23:06:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:06:07,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:07,231 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 23:06:07,231 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1896802094, now seen corresponding path program 1 times [2019-01-13 23:06:07,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:07,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:07,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:07,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:07,426 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 23:06:07,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:07,427 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 23:06:07,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:07,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:07,590 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:06:07,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:07,608 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 23:06:07,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-13 23:06:08,472 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 23:06:08,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:08,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-13 23:06:08,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 23:06:08,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 23:06:08,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:06:08,504 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 14 states. [2019-01-13 23:06:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:09,330 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-01-13 23:06:09,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:06:09,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2019-01-13 23:06:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:09,332 INFO L225 Difference]: With dead ends: 76 [2019-01-13 23:06:09,333 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 23:06:09,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-01-13 23:06:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 23:06:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-01-13 23:06:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 23:06:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-01-13 23:06:09,341 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2019-01-13 23:06:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:09,343 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-01-13 23:06:09,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 23:06:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-01-13 23:06:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 23:06:09,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:09,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:09,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -527287667, now seen corresponding path program 1 times [2019-01-13 23:06:09,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:09,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:09,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:09,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:09,461 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 23:06:09,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:09,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:06:09,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:06:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:06:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:06:09,463 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 8 states. [2019-01-13 23:06:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:09,827 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2019-01-13 23:06:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:06:09,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-01-13 23:06:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:09,831 INFO L225 Difference]: With dead ends: 123 [2019-01-13 23:06:09,831 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 23:06:09,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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 23:06:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 23:06:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-01-13 23:06:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-13 23:06:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2019-01-13 23:06:09,842 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 32 [2019-01-13 23:06:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:09,842 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2019-01-13 23:06:09,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:06:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2019-01-13 23:06:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 23:06:09,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:09,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:09,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -527287666, now seen corresponding path program 1 times [2019-01-13 23:06:09,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:09,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:09,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:10,012 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 23:06:10,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:10,013 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 23:06:10,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:10,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:10,224 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 23:06:10,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:10,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-13 23:06:10,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 23:06:10,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 23:06:10,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:06:10,245 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand 9 states. [2019-01-13 23:06:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:10,299 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-01-13 23:06:10,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:06:10,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-01-13 23:06:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:10,302 INFO L225 Difference]: With dead ends: 99 [2019-01-13 23:06:10,303 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 23:06:10,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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 23:06:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 23:06:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-01-13 23:06:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-13 23:06:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2019-01-13 23:06:10,312 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 32 [2019-01-13 23:06:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:10,312 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2019-01-13 23:06:10,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 23:06:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2019-01-13 23:06:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 23:06:10,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:10,316 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:06:10,317 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:10,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1884274114, now seen corresponding path program 2 times [2019-01-13 23:06:10,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:10,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:10,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:10,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:10,428 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 23:06:10,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:10,430 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 23:06:10,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 23:06:10,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 23:06:10,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:06:10,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:10,577 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 23:06:10,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 23:06:10,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-01-13 23:06:10,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 23:06:10,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 23:06:10,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:06:10,598 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand 9 states. [2019-01-13 23:06:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:10,929 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2019-01-13 23:06:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:06:10,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-13 23:06:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:10,939 INFO L225 Difference]: With dead ends: 140 [2019-01-13 23:06:10,939 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 23:06:10,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:06:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 23:06:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 101. [2019-01-13 23:06:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 23:06:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2019-01-13 23:06:10,950 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 35 [2019-01-13 23:06:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:10,950 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2019-01-13 23:06:10,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 23:06:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2019-01-13 23:06:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-13 23:06:10,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:10,953 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 23:06:10,954 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1217773515, now seen corresponding path program 1 times [2019-01-13 23:06:10,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:10,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:06:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:11,157 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 23:06:11,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:11,158 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 23:06:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:11,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:11,362 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 23:06:11,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-13 23:06:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 23:06:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 23:06:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-13 23:06:11,382 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand 13 states. [2019-01-13 23:06:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:11,468 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2019-01-13 23:06:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:06:11,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-01-13 23:06:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:11,474 INFO L225 Difference]: With dead ends: 106 [2019-01-13 23:06:11,474 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 23:06:11,474 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 23:06:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 23:06:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-01-13 23:06:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-13 23:06:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2019-01-13 23:06:11,482 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 38 [2019-01-13 23:06:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:11,482 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2019-01-13 23:06:11,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 23:06:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2019-01-13 23:06:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 23:06:11,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:11,485 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 23:06:11,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1394295675, now seen corresponding path program 2 times [2019-01-13 23:06:11,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:11,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:11,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:11,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:11,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:11,798 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 23:06:11,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:11,798 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 23:06:11,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 23:06:11,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 23:06:11,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:06:11,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:11,955 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 23:06:11,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:11,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-01-13 23:06:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 23:06:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 23:06:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-13 23:06:11,975 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand 15 states. [2019-01-13 23:06:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:12,175 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2019-01-13 23:06:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 23:06:12,176 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-01-13 23:06:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:12,179 INFO L225 Difference]: With dead ends: 109 [2019-01-13 23:06:12,179 INFO L226 Difference]: Without dead ends: 109 [2019-01-13 23:06:12,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-01-13 23:06:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-13 23:06:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-13 23:06:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-13 23:06:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2019-01-13 23:06:12,187 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 41 [2019-01-13 23:06:12,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:12,187 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2019-01-13 23:06:12,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 23:06:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2019-01-13 23:06:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 23:06:12,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:12,192 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 23:06:12,193 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1168973365, now seen corresponding path program 3 times [2019-01-13 23:06:12,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:12,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:12,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:06:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:13,042 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 23:06:13,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:13,042 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 23:06:13,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 23:06:13,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 23:06:13,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:06:13,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:13,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:06:13,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:13,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:13,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:06:13,581 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 23:06:13,587 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 23:06:13,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:13,592 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 23:06:13,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-13 23:06:13,606 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 23:06:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-01-13 23:06:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:06:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:06:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=190, Unknown=1, NotChecked=28, Total=272 [2019-01-13 23:06:13,626 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 17 states. [2019-01-13 23:06:14,357 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 23:06:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:15,175 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2019-01-13 23:06:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 23:06:15,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-01-13 23:06:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:15,179 INFO L225 Difference]: With dead ends: 144 [2019-01-13 23:06:15,180 INFO L226 Difference]: Without dead ends: 144 [2019-01-13 23:06:15,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=167, Invalid=705, Unknown=2, NotChecked=56, Total=930 [2019-01-13 23:06:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-13 23:06:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2019-01-13 23:06:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 23:06:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-01-13 23:06:15,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 44 [2019-01-13 23:06:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:15,189 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-01-13 23:06:15,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:06:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-01-13 23:06:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 23:06:15,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:15,194 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 23:06:15,194 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1001578876, now seen corresponding path program 1 times [2019-01-13 23:06:15,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:15,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:15,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:06:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:15,343 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 23:06:15,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:15,343 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 23:06:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:15,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:15,513 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 23:06:15,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:15,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-01-13 23:06:15,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-13 23:06:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-13 23:06:15,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2019-01-13 23:06:15,540 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 19 states. [2019-01-13 23:06:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:15,640 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2019-01-13 23:06:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:06:15,642 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2019-01-13 23:06:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:15,643 INFO L225 Difference]: With dead ends: 113 [2019-01-13 23:06:15,643 INFO L226 Difference]: Without dead ends: 113 [2019-01-13 23:06:15,644 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 23:06:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-13 23:06:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-01-13 23:06:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 23:06:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2019-01-13 23:06:15,652 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 47 [2019-01-13 23:06:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:15,653 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2019-01-13 23:06:15,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-13 23:06:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2019-01-13 23:06:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 23:06:15,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:15,663 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 23:06:15,663 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1104247860, now seen corresponding path program 2 times [2019-01-13 23:06:15,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:15,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:15,972 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 23:06:15,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:15,973 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 23:06:15,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 23:06:16,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 23:06:16,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:06:16,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:16,191 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 23:06:16,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:16,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-13 23:06:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 23:06:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 23:06:16,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-13 23:06:16,212 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 21 states. [2019-01-13 23:06:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:16,320 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-01-13 23:06:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 23:06:16,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2019-01-13 23:06:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:16,328 INFO L225 Difference]: With dead ends: 116 [2019-01-13 23:06:16,328 INFO L226 Difference]: Without dead ends: 116 [2019-01-13 23:06:16,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-01-13 23:06:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-13 23:06:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-01-13 23:06:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-13 23:06:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2019-01-13 23:06:16,334 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 50 [2019-01-13 23:06:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:16,335 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2019-01-13 23:06:16,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 23:06:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2019-01-13 23:06:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 23:06:16,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:16,339 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 23:06:16,339 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:16,340 INFO L82 PathProgramCache]: Analyzing trace with hash 798752636, now seen corresponding path program 3 times [2019-01-13 23:06:16,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:16,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:16,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:06:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:16,541 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 23:06:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:16,541 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 23:06:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 23:06:16,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 23:06:16,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:06:16,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:16,796 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:06:16,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:16,809 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:06:16,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:16,855 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 23:06:16,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-01-13 23:06:17,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:17,171 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 23:06:17,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:17,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:17,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:17,192 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:06:17,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:17,204 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 23:06:17,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2019-01-13 23:06:17,247 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 23:06:17,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:17,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-01-13 23:06:17,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 23:06:17,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 23:06:17,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-01-13 23:06:17,278 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand 22 states. [2019-01-13 23:06:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:21,450 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2019-01-13 23:06:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-13 23:06:21,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-01-13 23:06:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:21,455 INFO L225 Difference]: With dead ends: 227 [2019-01-13 23:06:21,455 INFO L226 Difference]: Without dead ends: 227 [2019-01-13 23:06:21,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 23:06:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-13 23:06:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 124. [2019-01-13 23:06:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-13 23:06:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2019-01-13 23:06:21,466 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 53 [2019-01-13 23:06:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:21,467 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2019-01-13 23:06:21,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 23:06:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2019-01-13 23:06:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:06:21,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:21,470 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 23:06:21,472 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 867545240, now seen corresponding path program 1 times [2019-01-13 23:06:21,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:06:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:21,649 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:06:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:06:21,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:06:21,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:06:21,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:21,653 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 5 states. [2019-01-13 23:06:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:21,686 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2019-01-13 23:06:21,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:06:21,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-13 23:06:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:21,692 INFO L225 Difference]: With dead ends: 136 [2019-01-13 23:06:21,692 INFO L226 Difference]: Without dead ends: 136 [2019-01-13 23:06:21,692 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 23:06:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-13 23:06:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2019-01-13 23:06:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-13 23:06:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2019-01-13 23:06:21,704 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 58 [2019-01-13 23:06:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:21,706 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2019-01-13 23:06:21,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:06:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2019-01-13 23:06:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:06:21,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:21,707 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 23:06:21,707 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:21,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1684611721, now seen corresponding path program 1 times [2019-01-13 23:06:21,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:21,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:21,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:21,894 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 23:06:21,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:06:21,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:06:21,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:06:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:06:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:06:21,896 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand 4 states. [2019-01-13 23:06:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:21,938 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2019-01-13 23:06:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:06:21,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 23:06:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:21,942 INFO L225 Difference]: With dead ends: 137 [2019-01-13 23:06:21,942 INFO L226 Difference]: Without dead ends: 137 [2019-01-13 23:06:21,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:06:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-13 23:06:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2019-01-13 23:06:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-13 23:06:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2019-01-13 23:06:21,951 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 58 [2019-01-13 23:06:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:21,951 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2019-01-13 23:06:21,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:06:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2019-01-13 23:06:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:06:21,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:21,955 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:06:21,956 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:21,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash -6885881, now seen corresponding path program 1 times [2019-01-13 23:06:21,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:21,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:22,150 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:06:22,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:22,151 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 23:06:22,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:22,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:22,713 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 23:06:22,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:22,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2019-01-13 23:06:22,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-13 23:06:22,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-13 23:06:22,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-01-13 23:06:22,734 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand 24 states. [2019-01-13 23:06:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:24,755 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2019-01-13 23:06:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 23:06:24,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2019-01-13 23:06:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:24,758 INFO L225 Difference]: With dead ends: 175 [2019-01-13 23:06:24,758 INFO L226 Difference]: Without dead ends: 175 [2019-01-13 23:06:24,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2019-01-13 23:06:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-13 23:06:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-01-13 23:06:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-13 23:06:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2019-01-13 23:06:24,765 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 65 [2019-01-13 23:06:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:24,765 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2019-01-13 23:06:24,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-13 23:06:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2019-01-13 23:06:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:06:24,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:24,766 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, 1] [2019-01-13 23:06:24,767 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -235163855, now seen corresponding path program 1 times [2019-01-13 23:06:24,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:24,891 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:06:24,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:24,892 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 23:06:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:24,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:25,006 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:06:25,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:25,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-13 23:06:25,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 23:06:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 23:06:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-01-13 23:06:25,027 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 11 states. [2019-01-13 23:06:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:25,472 INFO L93 Difference]: Finished difference Result 250 states and 308 transitions. [2019-01-13 23:06:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 23:06:25,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-01-13 23:06:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:25,476 INFO L225 Difference]: With dead ends: 250 [2019-01-13 23:06:25,476 INFO L226 Difference]: Without dead ends: 244 [2019-01-13 23:06:25,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-01-13 23:06:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-13 23:06:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 152. [2019-01-13 23:06:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-13 23:06:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2019-01-13 23:06:25,486 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 66 [2019-01-13 23:06:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:25,486 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2019-01-13 23:06:25,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 23:06:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2019-01-13 23:06:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:06:25,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:25,488 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:06:25,492 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 322998896, now seen corresponding path program 1 times [2019-01-13 23:06:25,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:25,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:25,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:25,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-01-13 23:06:25,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:25,908 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 23:06:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:26,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:26,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,440 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 23:06:26,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:26,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,460 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:06:26,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:26,471 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 23:06:26,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-13 23:06:26,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,610 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 23:06:26,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:26,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:26,630 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:06:26,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:26,641 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 23:06:26,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:20 [2019-01-13 23:06:26,690 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 23:06:26,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:06:26,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2019-01-13 23:06:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-13 23:06:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-13 23:06:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2019-01-13 23:06:26,711 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand 33 states. [2019-01-13 23:06:33,460 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-13 23:06:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:06:33,652 INFO L93 Difference]: Finished difference Result 308 states and 358 transitions. [2019-01-13 23:06:33,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-13 23:06:33,653 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2019-01-13 23:06:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:06:33,655 INFO L225 Difference]: With dead ends: 308 [2019-01-13 23:06:33,656 INFO L226 Difference]: Without dead ends: 308 [2019-01-13 23:06:33,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=533, Invalid=4023, Unknown=0, NotChecked=0, Total=4556 [2019-01-13 23:06:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-01-13 23:06:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 154. [2019-01-13 23:06:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-13 23:06:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2019-01-13 23:06:33,665 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 66 [2019-01-13 23:06:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:06:33,667 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2019-01-13 23:06:33,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-13 23:06:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2019-01-13 23:06:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:06:33,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:06:33,669 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:06:33,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err1REQUIRES_VIOLATION, free_17Err0REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:06:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:06:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash -213461981, now seen corresponding path program 1 times [2019-01-13 23:06:33,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 23:06:33,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 23:06:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:33,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 23:06:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:34,596 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 23:06:34,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:06:34,596 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 23:06:34,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:06:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:06:34,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:06:34,692 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:06:34,696 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:06:34,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2019-01-13 23:06:34,735 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:06:34,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:34,763 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:06:34,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-13 23:06:34,898 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 23:06:34,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:34,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:34,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:34,904 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 23:06:34,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:34,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-01-13 23:06:35,083 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 23:06:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,111 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 23:06:35,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:35,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:35,148 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:06:35,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:62 [2019-01-13 23:06:35,352 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 23:06:35,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,367 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 23:06:35,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:35,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:35,423 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 23:06:35,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:78 [2019-01-13 23:06:35,577 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 23:06:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:35,602 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 23:06:35,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,119 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 23:06:36,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:94 [2019-01-13 23:06:36,332 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 23:06:36,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,363 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 23:06:36,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,486 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 23:06:36,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:114, output treesize:110 [2019-01-13 23:06:36,757 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 23:06:36,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:36,819 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 23:06:36,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:36,957 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 23:06:36,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:130, output treesize:126 [2019-01-13 23:06:44,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 106 treesize of output 87 [2019-01-13 23:06:44,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:44,828 INFO L303 Elim1Store]: Index analysis took 331 ms [2019-01-13 23:06:44,830 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 23:06:44,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:44,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:45,026 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 23:06:45,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:146, output treesize:142 [2019-01-13 23:06:58,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 117 treesize of output 96 [2019-01-13 23:06:58,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:06:59,014 INFO L303 Elim1Store]: Index analysis took 147 ms [2019-01-13 23:06:59,016 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 23:06:59,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:06:59,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:06:59,307 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 23:06:59,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:162, output treesize:158 [2019-01-13 23:07:23,578 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-13 23:07:23,779 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:07:23,780 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 23:07:23,793 INFO L168 Benchmark]: Toolchain (without parser) took 82792.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.2 MB). Free memory was 943.3 MB in the beginning and 1.4 GB in the end (delta: -407.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-13 23:07:23,794 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:07:23,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-01-13 23:07:23,795 INFO L168 Benchmark]: Boogie Preprocessor took 122.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:07:23,795 INFO L168 Benchmark]: RCFGBuilder took 2566.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:07:23,795 INFO L168 Benchmark]: TraceAbstraction took 79312.94 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 984.0 MB in the beginning and 1.4 GB in the end (delta: -366.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:07:23,804 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 787.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2566.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.0 MB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79312.94 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 984.0 MB in the beginning and 1.4 GB in the end (delta: -366.6 MB). There was no memory consumed. 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 23:07:25,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 23:07:25,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 23:07:25,784 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 23:07:25,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 23:07:25,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 23:07:25,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 23:07:25,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 23:07:25,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 23:07:25,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 23:07:25,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 23:07:25,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 23:07:25,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 23:07:25,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 23:07:25,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 23:07:25,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 23:07:25,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 23:07:25,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 23:07:25,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 23:07:25,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 23:07:25,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 23:07:25,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 23:07:25,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 23:07:25,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 23:07:25,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 23:07:25,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 23:07:25,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 23:07:25,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 23:07:25,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 23:07:25,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 23:07:25,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 23:07:25,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 23:07:25,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 23:07:25,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 23:07:25,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 23:07:25,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 23:07:25,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 23:07:25,840 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 23:07:25,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 23:07:25,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 23:07:25,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 23:07:25,842 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 23:07:25,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 23:07:25,843 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 23:07:25,843 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 23:07:25,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 23:07:25,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 23:07:25,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 23:07:25,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 23:07:25,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 23:07:25,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 23:07:25,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 23:07:25,844 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 23:07:25,845 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 23:07:25,846 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 23:07:25,846 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 23:07:25,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 23:07:25,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 23:07:25,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 23:07:25,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 23:07:25,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 23:07:25,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 23:07:25,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 23:07:25,849 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 23:07:25,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 23:07:25,849 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 23:07:25,849 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 -> 629d5a636c5f2810554fe722d7d0f8126d0f15df [2019-01-13 23:07:25,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 23:07:25,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 23:07:25,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 23:07:25,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 23:07:25,905 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 23:07:25,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:07:25,964 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55871ea5/a5bc3657a01c4c44800406553ea7e1d0/FLAG78fa77e67 [2019-01-13 23:07:26,525 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 23:07:26,526 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:07:26,544 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55871ea5/a5bc3657a01c4c44800406553ea7e1d0/FLAG78fa77e67 [2019-01-13 23:07:26,806 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55871ea5/a5bc3657a01c4c44800406553ea7e1d0 [2019-01-13 23:07:26,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 23:07:26,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 23:07:26,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 23:07:26,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 23:07:26,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 23:07:26,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:07:26" (1/1) ... [2019-01-13 23:07:26,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276c0f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:26, skipping insertion in model container [2019-01-13 23:07:26,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 11:07:26" (1/1) ... [2019-01-13 23:07:26,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 23:07:26,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 23:07:27,424 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:07:27,453 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 23:07:27,644 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 23:07:27,734 INFO L195 MainTranslator]: Completed translation [2019-01-13 23:07:27,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27 WrapperNode [2019-01-13 23:07:27,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 23:07:27,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 23:07:27,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 23:07:27,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 23:07:27,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (1/1) ... [2019-01-13 23:07:27,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 23:07:27,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 23:07:27,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 23:07:27,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 23:07:27,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (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 23:07:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 23:07:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 23:07:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:07:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:07:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-13 23:07:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-13 23:07:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-13 23:07:27,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-13 23:07:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-13 23:07:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-13 23:07:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:07:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-13 23:07:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-13 23:07:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-13 23:07:27,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-13 23:07:27,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-13 23:07:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-13 23:07:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-13 23:07:27,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-13 23:07:27,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-13 23:07:27,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-13 23:07:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-13 23:07:27,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-13 23:07:27,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-13 23:07:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-13 23:07:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-13 23:07:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-13 23:07:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-13 23:07:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-13 23:07:27,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-13 23:07:27,949 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-13 23:07:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-13 23:07:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 23:07:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 23:07:27,950 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 23:07:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 23:07:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 23:07:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 23:07:27,951 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 23:07:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 23:07:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 23:07:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 23:07:27,953 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 23:07:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 23:07:27,954 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 23:07:27,955 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 23:07:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 23:07:27,957 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 23:07:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 23:07:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 23:07:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 23:07:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 23:07:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 23:07:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 23:07:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 23:07:27,965 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 23:07:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 23:07:27,967 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 23:07:27,968 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 23:07:27,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 23:07:27,970 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 23:07:27,971 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 23:07:27,971 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 23:07:27,971 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 23:07:27,971 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 23:07:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 23:07:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 23:07:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 23:07:27,976 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 23:07:27,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 23:07:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 23:07:27,980 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 23:07:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 23:07:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-13 23:07:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-13 23:07:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-13 23:07:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 23:07:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-13 23:07:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-13 23:07:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-13 23:07:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 23:07:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-13 23:07:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-13 23:07:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-13 23:07:27,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-13 23:07:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-13 23:07:27,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-13 23:07:27,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-13 23:07:27,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-13 23:07:27,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 23:07:27,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 23:07:28,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 23:07:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 23:07:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 23:07:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 23:07:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-13 23:07:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-13 23:07:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-01-13 23:07:28,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-01-13 23:07:28,815 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:07:29,769 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-13 23:07:31,316 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 23:07:31,317 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-13 23:07:31,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:07:31 BoogieIcfgContainer [2019-01-13 23:07:31,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 23:07:31,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 23:07:31,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 23:07:31,327 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 23:07:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 11:07:26" (1/3) ... [2019-01-13 23:07:31,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bffa098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:07:31, skipping insertion in model container [2019-01-13 23:07:31,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 11:07:27" (2/3) ... [2019-01-13 23:07:31,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bffa098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 11:07:31, skipping insertion in model container [2019-01-13 23:07:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:07:31" (3/3) ... [2019-01-13 23:07:31,332 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2019-01-13 23:07:31,343 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 23:07:31,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-01-13 23:07:31,375 INFO L257 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-01-13 23:07:31,403 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 23:07:31,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 23:07:31,404 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 23:07:31,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 23:07:31,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 23:07:31,405 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 23:07:31,405 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 23:07:31,405 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 23:07:31,405 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 23:07:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-01-13 23:07:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:07:31,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:31,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:07:31,441 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 353760605, now seen corresponding path program 1 times [2019-01-13 23:07:31,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:31,455 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 23:07:31,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:31,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:31,647 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 23:07:31,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:07:31,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:07:31,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:07:31,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:07:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:07:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:07:31,679 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 5 states. [2019-01-13 23:07:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:31,799 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-01-13 23:07:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:07:31,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 23:07:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:31,812 INFO L225 Difference]: With dead ends: 77 [2019-01-13 23:07:31,813 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 23:07:31,815 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 23:07:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 23:07:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-01-13 23:07:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 23:07:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-01-13 23:07:31,861 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 16 [2019-01-13 23:07:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-01-13 23:07:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:07:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-01-13 23:07:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:07:31,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:31,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:07:31,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash -533743076, now seen corresponding path program 1 times [2019-01-13 23:07:31,868 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:31,868 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 23:07:31,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:31,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:31,989 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:07:31,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:07:32,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:07:32,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:07:32,154 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 23:07:32,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:07:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:07:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:07:32,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:07:32,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:07:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:07:32,167 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 5 states. [2019-01-13 23:07:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:32,787 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2019-01-13 23:07:32,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:07:32,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-13 23:07:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:32,790 INFO L225 Difference]: With dead ends: 73 [2019-01-13 23:07:32,790 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 23:07:32,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:07:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 23:07:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-13 23:07:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 23:07:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-01-13 23:07:32,801 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 16 [2019-01-13 23:07:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:32,802 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-01-13 23:07:32,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:07:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-01-13 23:07:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 23:07:32,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:32,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 23:07:32,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -533743075, now seen corresponding path program 1 times [2019-01-13 23:07:32,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:32,808 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 23:07:32,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:32,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:32,936 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:07:32,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:07:32,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:07:32,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:07:33,047 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 23:07:33,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:07:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:07:33,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 23:07:33,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:07:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:07:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 23:07:33,058 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 8 states. [2019-01-13 23:07:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:33,516 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-01-13 23:07:33,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 23:07:33,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-13 23:07:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:33,520 INFO L225 Difference]: With dead ends: 76 [2019-01-13 23:07:33,520 INFO L226 Difference]: Without dead ends: 76 [2019-01-13 23:07:33,521 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 23:07:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-13 23:07:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2019-01-13 23:07:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-13 23:07:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2019-01-13 23:07:33,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 16 [2019-01-13 23:07:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:33,531 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2019-01-13 23:07:33,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:07:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2019-01-13 23:07:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:07:33,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:33,534 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 23:07:33,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1918339372, now seen corresponding path program 1 times [2019-01-13 23:07:33,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:33,536 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 23:07:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:33,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:33,613 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 23:07:33,613 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:07:33,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:07:33,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 23:07:33,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 23:07:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 23:07:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 23:07:33,616 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 3 states. [2019-01-13 23:07:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:33,921 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2019-01-13 23:07:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 23:07:33,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-13 23:07:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:33,924 INFO L225 Difference]: With dead ends: 111 [2019-01-13 23:07:33,924 INFO L226 Difference]: Without dead ends: 106 [2019-01-13 23:07:33,924 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 23:07:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-13 23:07:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 71. [2019-01-13 23:07:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 23:07:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-01-13 23:07:33,934 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2019-01-13 23:07:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:33,935 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-01-13 23:07:33,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 23:07:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-01-13 23:07:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-13 23:07:33,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:33,937 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 23:07:33,938 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash 633817589, now seen corresponding path program 1 times [2019-01-13 23:07:33,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:33,939 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 23:07:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:34,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:34,222 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 23:07:34,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:07:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:07:34,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:07:34,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:07:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:07:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:07:34,228 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 5 states. [2019-01-13 23:07:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:34,296 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-01-13 23:07:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:07:34,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-13 23:07:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:34,300 INFO L225 Difference]: With dead ends: 71 [2019-01-13 23:07:34,300 INFO L226 Difference]: Without dead ends: 71 [2019-01-13 23:07:34,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 23:07:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-13 23:07:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-13 23:07:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 23:07:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-01-13 23:07:34,307 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-01-13 23:07:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:34,307 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-01-13 23:07:34,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:07:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-01-13 23:07:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-13 23:07:34,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:34,308 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 23:07:34,310 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash -770651275, now seen corresponding path program 1 times [2019-01-13 23:07:34,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:34,313 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 23:07:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:07:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:34,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:34,447 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:07:34,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:07:34,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:07:34,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:07:34,623 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 23:07:34,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:07:36,374 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-13 23:07:36,706 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 23:07:36,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:07:36,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-01-13 23:07:36,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 23:07:36,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 23:07:36,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-01-13 23:07:36,712 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 17 states. [2019-01-13 23:07:38,218 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-13 23:07:40,681 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-13 23:07:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:41,368 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2019-01-13 23:07:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 23:07:41,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2019-01-13 23:07:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:41,370 INFO L225 Difference]: With dead ends: 84 [2019-01-13 23:07:41,371 INFO L226 Difference]: Without dead ends: 84 [2019-01-13 23:07:41,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-01-13 23:07:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-13 23:07:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-01-13 23:07:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-13 23:07:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-01-13 23:07:41,378 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 19 [2019-01-13 23:07:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:41,379 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-01-13 23:07:41,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 23:07:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-01-13 23:07:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 23:07:41,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:41,381 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 23:07:41,382 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1012417507, now seen corresponding path program 2 times [2019-01-13 23:07:41,383 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:41,383 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 23:07:41,402 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 23:07:41,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 23:07:41,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:07:41,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:41,550 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:07:41,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:07:41,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:07:41,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:07:41,782 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 23:07:41,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:07:43,664 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 23:07:43,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:07:43,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-01-13 23:07:43,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-13 23:07:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-13 23:07:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-01-13 23:07:43,668 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 22 states. [2019-01-13 23:07:45,290 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-01-13 23:07:45,643 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-01-13 23:07:46,430 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-13 23:07:46,638 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-01-13 23:07:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:47,918 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2019-01-13 23:07:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-13 23:07:47,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-01-13 23:07:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:47,922 INFO L225 Difference]: With dead ends: 105 [2019-01-13 23:07:47,922 INFO L226 Difference]: Without dead ends: 105 [2019-01-13 23:07:47,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2019-01-13 23:07:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-13 23:07:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2019-01-13 23:07:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-13 23:07:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-13 23:07:47,931 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 28 [2019-01-13 23:07:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:47,931 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-13 23:07:47,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-13 23:07:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-13 23:07:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 23:07:47,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:47,935 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 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 23:07:47,935 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash 492718275, now seen corresponding path program 1 times [2019-01-13 23:07:47,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:47,936 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 23:07:47,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:07:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:07:48,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:48,193 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 23:07:48,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:07:48,425 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 23:07:48,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:07:48,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-13 23:07:48,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 23:07:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 23:07:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-01-13 23:07:48,435 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 16 states. [2019-01-13 23:07:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:07:49,107 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-01-13 23:07:49,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 23:07:49,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-01-13 23:07:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:07:49,111 INFO L225 Difference]: With dead ends: 98 [2019-01-13 23:07:49,111 INFO L226 Difference]: Without dead ends: 98 [2019-01-13 23:07:49,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-13 23:07:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-13 23:07:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-13 23:07:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-13 23:07:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-01-13 23:07:49,129 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 41 [2019-01-13 23:07:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:07:49,129 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-01-13 23:07:49,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 23:07:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-01-13 23:07:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-13 23:07:49,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:07:49,131 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 23:07:49,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:07:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:07:49,132 INFO L82 PathProgramCache]: Analyzing trace with hash 278667037, now seen corresponding path program 3 times [2019-01-13 23:07:49,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:07:49,132 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 23:07:49,155 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2019-01-13 23:07:49,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-13 23:07:49,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:07:49,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:07:49,575 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:07:49,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:07:49,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:07:49,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:07:50,167 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 23:07:51,246 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 23:07:51,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:07:51,904 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-01-13 23:07:52,988 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-13 23:07:53,354 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-13 23:07:53,735 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 23:07:54,347 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-01-13 23:07:54,953 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-13 23:07:55,449 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 23:07:56,021 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 23:07:56,572 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 23:07:57,130 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-13 23:07:59,444 WARN L181 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-01-13 23:08:00,370 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-13 23:08:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 23:08:00,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:00,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2019-01-13 23:08:00,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-13 23:08:00,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-13 23:08:00,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2019-01-13 23:08:00,424 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 38 states. [2019-01-13 23:08:01,672 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-13 23:08:02,769 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-13 23:08:08,454 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 142 [2019-01-13 23:08:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:11,380 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-01-13 23:08:11,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-13 23:08:11,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-01-13 23:08:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:11,383 INFO L225 Difference]: With dead ends: 98 [2019-01-13 23:08:11,383 INFO L226 Difference]: Without dead ends: 98 [2019-01-13 23:08:11,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2019-01-13 23:08:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-13 23:08:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-13 23:08:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-13 23:08:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-01-13 23:08:11,389 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 46 [2019-01-13 23:08:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:11,390 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-01-13 23:08:11,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-13 23:08:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-01-13 23:08:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 23:08:11,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:11,393 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 23:08:11,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1961366421, now seen corresponding path program 2 times [2019-01-13 23:08:11,397 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:11,397 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 23:08:11,419 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-13 23:08:11,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 23:08:11,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 23:08:11,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:11,515 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:08:11,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:08:11,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:08:11,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:08:11,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:08:11,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:08:11,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:08:11,519 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2019-01-13 23:08:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:11,553 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2019-01-13 23:08:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:08:11,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-13 23:08:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:11,556 INFO L225 Difference]: With dead ends: 100 [2019-01-13 23:08:11,556 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 23:08:11,557 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 23:08:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 23:08:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-01-13 23:08:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-13 23:08:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-01-13 23:08:11,561 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 56 [2019-01-13 23:08:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:11,562 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-01-13 23:08:11,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:08:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-01-13 23:08:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 23:08:11,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:11,564 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 23:08:11,565 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1989995572, now seen corresponding path program 1 times [2019-01-13 23:08:11,565 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:11,566 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 23:08:11,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 23:08:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:11,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:11,853 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:08:11,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:11,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:11,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:08:12,417 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 23:08:12,440 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 23:08:12,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:12,481 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 23:08:12,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-01-13 23:08:12,498 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 23:08:12,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (12)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:08:12,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 23:08:12,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2019-01-13 23:08:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:08:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:08:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=51, Unknown=7, NotChecked=14, Total=90 [2019-01-13 23:08:12,644 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 10 states. [2019-01-13 23:08:13,852 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-01-13 23:08:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:14,581 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2019-01-13 23:08:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:08:14,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-01-13 23:08:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:14,584 INFO L225 Difference]: With dead ends: 143 [2019-01-13 23:08:14,584 INFO L226 Difference]: Without dead ends: 143 [2019-01-13 23:08:14,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=130, Unknown=12, NotChecked=24, Total=210 [2019-01-13 23:08:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-13 23:08:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 96. [2019-01-13 23:08:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-13 23:08:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-01-13 23:08:14,591 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 56 [2019-01-13 23:08:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:14,591 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-01-13 23:08:14,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:08:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-01-13 23:08:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 23:08:14,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:14,593 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 23:08:14,593 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1989995571, now seen corresponding path program 1 times [2019-01-13 23:08:14,598 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:14,598 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 23:08:14,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:14,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:14,949 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:08:14,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:14,963 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:08:14,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:14,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:14,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:08:16,223 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:08:16,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:16,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:16,233 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:08:16,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,257 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 23:08:16,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,275 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:08:16,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-13 23:08:16,309 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:08:16,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:16,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:08:16,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP 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 23:08:16,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:16,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:16,863 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:08:16,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-13 23:08:16,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:08:16,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:16,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:16,927 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:08:16,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,956 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 23:08:16,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:16,986 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:08:16,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-13 23:08:16,997 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:08:16,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:17,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:17,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-13 23:08:17,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 23:08:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 23:08:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2019-01-13 23:08:17,292 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 12 states. [2019-01-13 23:08:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:18,854 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2019-01-13 23:08:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 23:08:18,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-01-13 23:08:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:18,863 INFO L225 Difference]: With dead ends: 157 [2019-01-13 23:08:18,863 INFO L226 Difference]: Without dead ends: 157 [2019-01-13 23:08:18,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2019-01-13 23:08:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-13 23:08:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2019-01-13 23:08:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 23:08:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2019-01-13 23:08:18,875 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 56 [2019-01-13 23:08:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:18,877 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2019-01-13 23:08:18,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 23:08:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2019-01-13 23:08:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 23:08:18,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:18,883 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] [2019-01-13 23:08:18,884 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash -834901652, now seen corresponding path program 1 times [2019-01-13 23:08:18,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:18,890 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 23:08:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:19,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:19,314 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:08:19,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:08:19,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:08:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:08:19,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:08:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:08:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:08:19,318 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 5 states. [2019-01-13 23:08:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:19,430 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-01-13 23:08:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 23:08:19,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-01-13 23:08:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:19,433 INFO L225 Difference]: With dead ends: 124 [2019-01-13 23:08:19,433 INFO L226 Difference]: Without dead ends: 121 [2019-01-13 23:08:19,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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:08:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-13 23:08:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2019-01-13 23:08:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 23:08:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-13 23:08:19,439 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 56 [2019-01-13 23:08:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:19,440 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-13 23:08:19,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:08:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-13 23:08:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-13 23:08:19,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:19,442 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 23:08:19,442 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 617467928, now seen corresponding path program 1 times [2019-01-13 23:08:19,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:19,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:08:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:19,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:19,712 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 23:08:19,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:08:19,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:08:19,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 23:08:19,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 23:08:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 23:08:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 23:08:19,719 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 4 states. [2019-01-13 23:08:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:19,834 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2019-01-13 23:08:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 23:08:19,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-13 23:08:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:19,837 INFO L225 Difference]: With dead ends: 109 [2019-01-13 23:08:19,837 INFO L226 Difference]: Without dead ends: 109 [2019-01-13 23:08:19,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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 23:08:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-13 23:08:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-01-13 23:08:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-13 23:08:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-01-13 23:08:19,842 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 58 [2019-01-13 23:08:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:19,842 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-01-13 23:08:19,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 23:08:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-01-13 23:08:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:08:19,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:19,846 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:08:19,847 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2072577356, now seen corresponding path program 1 times [2019-01-13 23:08:19,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:19,848 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:08:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:20,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:20,096 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:08:20,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:20,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:20,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:08:20,166 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:08:20,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:20,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:08:20,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:08:20,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:20,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:20,452 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:08:20,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:20,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:20,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 23:08:20,484 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:08:20,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:20,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:20,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-13 23:08:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 23:08:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 23:08:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=50, Unknown=6, NotChecked=0, Total=72 [2019-01-13 23:08:20,771 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 8 states. [2019-01-13 23:08:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:21,347 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-01-13 23:08:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 23:08:21,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-01-13 23:08:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:21,349 INFO L225 Difference]: With dead ends: 138 [2019-01-13 23:08:21,350 INFO L226 Difference]: Without dead ends: 138 [2019-01-13 23:08:21,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=89, Unknown=9, NotChecked=0, Total=132 [2019-01-13 23:08:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-13 23:08:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2019-01-13 23:08:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-13 23:08:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-01-13 23:08:21,356 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 65 [2019-01-13 23:08:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:21,358 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-01-13 23:08:21,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 23:08:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-01-13 23:08:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:08:21,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:21,359 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:08:21,359 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:21,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2072577357, now seen corresponding path program 1 times [2019-01-13 23:08:21,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:21,363 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:08:21,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:21,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:21,648 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:08:21,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:21,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:21,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:08:22,171 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:08:22,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (19)] Exception during sending of exit command (exit): Broken pipe [2019-01-13 23:08:22,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:08:22,555 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:08:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:22,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:22,640 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:08:22,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:22,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:22,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:08:22,681 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:08:22,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:23,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:23,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-13 23:08:23,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 23:08:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 23:08:23,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-01-13 23:08:23,382 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 10 states. [2019-01-13 23:08:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:24,345 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2019-01-13 23:08:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 23:08:24,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-01-13 23:08:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:24,348 INFO L225 Difference]: With dead ends: 142 [2019-01-13 23:08:24,348 INFO L226 Difference]: Without dead ends: 142 [2019-01-13 23:08:24,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-01-13 23:08:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-13 23:08:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2019-01-13 23:08:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-13 23:08:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2019-01-13 23:08:24,354 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 65 [2019-01-13 23:08:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:24,355 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2019-01-13 23:08:24,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 23:08:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2019-01-13 23:08:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-13 23:08:24,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:24,357 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:08:24,358 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:24,358 INFO L82 PathProgramCache]: Analyzing trace with hash 565025547, now seen corresponding path program 1 times [2019-01-13 23:08:24,360 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:24,360 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:08:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:24,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:24,514 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:08:24,514 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 23:08:24,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 23:08:24,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 23:08:24,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 23:08:24,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 23:08:24,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 23:08:24,517 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand 5 states. [2019-01-13 23:08:24,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:24,665 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2019-01-13 23:08:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 23:08:24,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-01-13 23:08:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:24,668 INFO L225 Difference]: With dead ends: 123 [2019-01-13 23:08:24,668 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 23:08:24,669 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:08:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 23:08:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-01-13 23:08:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-13 23:08:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2019-01-13 23:08:24,674 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 65 [2019-01-13 23:08:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:24,676 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2019-01-13 23:08:24,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 23:08:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2019-01-13 23:08:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:08:24,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:24,677 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:08:24,678 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:24,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash -174611037, now seen corresponding path program 1 times [2019-01-13 23:08:24,680 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:08:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:25,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:25,344 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:08:25,349 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:08:25,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-13 23:08:25,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-13 23:08:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,415 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:08:25,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-13 23:08:25,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 35 treesize of output 28 [2019-01-13 23:08:25,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,520 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:08:25,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-01-13 23:08:25,666 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:08:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,678 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:08:25,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-01-13 23:08:25,869 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 59 treesize of output 48 [2019-01-13 23:08:25,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:25,910 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 48 treesize of output 171 [2019-01-13 23:08:25,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:25,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-01-13 23:08:26,183 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 71 treesize of output 58 [2019-01-13 23:08:26,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,232 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 58 treesize of output 247 [2019-01-13 23:08:26,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2019-01-13 23:08:26,685 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 83 treesize of output 68 [2019-01-13 23:08:26,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:26,740 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 68 treesize of output 337 [2019-01-13 23:08:26,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:26,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2019-01-13 23:08:27,173 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 23:08:27,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,290 INFO L303 Elim1Store]: Index analysis took 114 ms [2019-01-13 23:08:27,291 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 23:08:27,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:27,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:27,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:27,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2019-01-13 23:08:27,776 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:08:27,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:27,971 INFO L303 Elim1Store]: Index analysis took 193 ms [2019-01-13 23:08:27,973 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:08:27,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:90 [2019-01-13 23:08:28,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 93 treesize of output 72 [2019-01-13 23:08:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:28,613 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-13 23:08:28,618 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:08:28,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:28,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-01-13 23:08:29,763 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:08:29,769 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:08:29,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:29,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:29,773 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:08:29,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:3 [2019-01-13 23:08:29,864 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:08:29,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:30,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:08:30,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 23:08:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:30,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:30,503 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:08:30,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:30,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:30,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 23:08:30,922 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:08:30,929 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:08:30,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:30,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:30,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:30,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-13 23:08:31,236 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:08:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,242 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:08:31,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:34 [2019-01-13 23:08:31,579 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:08:31,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,617 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:08:31,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,627 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:08:31,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,654 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:08:31,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:29 [2019-01-13 23:08:31,805 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:08:31,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:31,819 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:08:31,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:31,865 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:08:31,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:32,047 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:08:32,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,070 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:08:32,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,118 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:08:32,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:32,299 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:08:32,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,312 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:08:32,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,355 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:08:32,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:32,549 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:08:32,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,571 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:08:32,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,616 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:08:32,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:32,793 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:08:32,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:32,820 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:08:32,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:32,864 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:08:32,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:33,054 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:08:33,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,076 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:08:33,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:33,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:33,121 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:08:33,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:33,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:08:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:33,324 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:08:33,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:33,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:33,371 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:08:33,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-13 23:08:34,307 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:08:34,312 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:08:34,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:34,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:34,316 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:08:34,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2019-01-13 23:08:34,330 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:08:34,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:34,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:34,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16] total 41 [2019-01-13 23:08:34,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-13 23:08:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-13 23:08:34,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1882, Unknown=1, NotChecked=0, Total=2070 [2019-01-13 23:08:34,543 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 42 states. [2019-01-13 23:08:42,058 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-13 23:08:43,147 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-13 23:08:43,541 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-13 23:08:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:45,259 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-01-13 23:08:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-13 23:08:45,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2019-01-13 23:08:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:45,262 INFO L225 Difference]: With dead ends: 136 [2019-01-13 23:08:45,262 INFO L226 Difference]: Without dead ends: 136 [2019-01-13 23:08:45,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 109 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=507, Invalid=5812, Unknown=1, NotChecked=0, Total=6320 [2019-01-13 23:08:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-13 23:08:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-01-13 23:08:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-13 23:08:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-01-13 23:08:45,269 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 66 [2019-01-13 23:08:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:45,269 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-01-13 23:08:45,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-13 23:08:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-01-13 23:08:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:08:45,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:45,270 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:08:45,271 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -463903149, now seen corresponding path program 1 times [2019-01-13 23:08:45,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:45,272 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:08:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:45,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:45,649 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:08:45,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:45,670 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:08:45,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:45,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:45,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:08:47,136 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:08:47,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:47,147 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 23:08:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:47,179 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:08:47,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,199 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:08:47,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-13 23:08:47,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:47,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:47,274 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:08:47,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,306 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 23:08:47,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,326 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:08:47,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2019-01-13 23:08:47,366 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:08:47,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:47,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 23:08:47,854 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:08:47,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:47,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:47,960 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:08:47,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,978 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:08:47,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 23:08:47,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 23:08:48,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,041 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 23:08:48,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,074 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:08:48,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:48,095 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:08:48,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-01-13 23:08:48,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,146 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 23:08:48,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:48,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 23:08:48,187 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:08:48,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 23:08:48,206 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:08:48,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2019-01-13 23:08:48,220 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:08:48,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:48,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:48,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-13 23:08:48,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 23:08:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 23:08:48,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=176, Unknown=1, NotChecked=26, Total=240 [2019-01-13 23:08:48,510 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 14 states. [2019-01-13 23:08:50,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:50,253 INFO L93 Difference]: Finished difference Result 167 states and 187 transitions. [2019-01-13 23:08:50,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 23:08:50,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-01-13 23:08:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:50,256 INFO L225 Difference]: With dead ends: 167 [2019-01-13 23:08:50,257 INFO L226 Difference]: Without dead ends: 167 [2019-01-13 23:08:50,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=70, Invalid=395, Unknown=1, NotChecked=40, Total=506 [2019-01-13 23:08:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-13 23:08:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 128. [2019-01-13 23:08:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-13 23:08:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2019-01-13 23:08:50,266 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 66 [2019-01-13 23:08:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:50,267 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2019-01-13 23:08:50,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 23:08:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2019-01-13 23:08:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-13 23:08:50,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:50,270 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, 1] [2019-01-13 23:08:50,271 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 691190770, now seen corresponding path program 1 times [2019-01-13 23:08:50,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:50,272 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:08:50,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 23:08:50,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 23:08:50,667 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:08:50,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 23:08:50,824 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:08:50,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 23:08:50,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-01-13 23:08:50,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 23:08:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 23:08:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 23:08:50,828 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 9 states. [2019-01-13 23:08:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 23:08:51,034 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2019-01-13 23:08:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 23:08:51,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-01-13 23:08:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 23:08:51,038 INFO L225 Difference]: With dead ends: 153 [2019-01-13 23:08:51,038 INFO L226 Difference]: Without dead ends: 150 [2019-01-13 23:08:51,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-13 23:08:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-13 23:08:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 128. [2019-01-13 23:08:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-13 23:08:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2019-01-13 23:08:51,043 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 66 [2019-01-13 23:08:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 23:08:51,046 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2019-01-13 23:08:51,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 23:08:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2019-01-13 23:08:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-13 23:08:51,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 23:08:51,047 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:08:51,048 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_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_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, 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_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-13 23:08:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 23:08:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1117974420, now seen corresponding path program 1 times [2019-01-13 23:08:51,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 23:08:51,053 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 23:08:51,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 23:08:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:08:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 23:08:52,942 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 23:08:52,975 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:08:52,976 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:08:53,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 11:08:53 BoogieIcfgContainer [2019-01-13 23:08:53,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 23:08:53,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 23:08:53,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 23:08:53,022 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 23:08:53,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 11:07:31" (3/4) ... [2019-01-13 23:08:53,027 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 23:08:53,045 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:08:53,046 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:08:53,129 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 23:08:53,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 23:08:53,131 INFO L168 Benchmark]: Toolchain (without parser) took 86321.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 937.9 MB in the beginning and 1.3 GB in the end (delta: -361.2 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-13 23:08:53,131 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:08:53,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 923.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-13 23:08:53,134 INFO L168 Benchmark]: Boogie Preprocessor took 122.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:08:53,134 INFO L168 Benchmark]: RCFGBuilder took 3462.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. [2019-01-13 23:08:53,134 INFO L168 Benchmark]: TraceAbstraction took 81692.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 975.1 MB in the beginning and 1.3 GB in the end (delta: -335.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 23:08:53,137 INFO L168 Benchmark]: Witness Printer took 113.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-13 23:08:53,141 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 923.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3462.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 119.9 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81692.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 264.2 MB). Free memory was 975.1 MB in the beginning and 1.3 GB in the end (delta: -335.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 113.80 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. 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_17(array, len) VAL [alloc_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