./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.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 d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:26:50,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:26:50,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:26:50,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:26:50,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:26:50,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:26:50,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:26:50,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:26:50,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:26:50,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:26:50,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:26:50,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:26:50,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:26:50,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:26:50,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:26:50,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:26:50,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:26:50,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:26:50,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:26:50,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:26:50,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:26:50,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:26:50,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:26:50,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:26:50,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:26:50,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:26:50,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:26:50,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:26:50,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:26:50,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:26:50,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:26:50,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:26:50,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:26:50,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:26:50,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:26:50,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:26:50,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:26:50,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:26:50,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:26:50,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:26:50,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:26:50,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:26:50,891 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:26:50,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:26:50,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:26:50,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:26:50,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:26:50,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:26:50,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:26:50,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:26:50,895 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:26:50,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:26:50,896 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:26:50,897 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:26:50,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:26:50,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:26:50,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:26:50,897 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:26:50,898 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:26:50,898 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:26:50,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:26:50,898 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:26:50,898 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:26:50,899 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:26:50,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:26:50,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:26:50,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:26:50,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:26:50,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:26:50,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:26:50,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:26:50,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:26:50,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:26:50,901 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:26:50,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:26:50,901 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:26:50,902 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2023-02-16 03:26:51,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:26:51,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:26:51,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:26:51,183 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:26:51,184 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:26:51,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-16 03:26:52,706 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:26:53,003 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:26:53,003 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-16 03:26:53,025 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11fb09f7/a6937a4343754fe086a0e33f992454d6/FLAGc7e353c4d [2023-02-16 03:26:53,044 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11fb09f7/a6937a4343754fe086a0e33f992454d6 [2023-02-16 03:26:53,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:26:53,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:26:53,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:26:53,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:26:53,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:26:53,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:26:53" (1/1) ... [2023-02-16 03:26:53,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6890b3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:53, skipping insertion in model container [2023-02-16 03:26:53,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:26:53" (1/1) ... [2023-02-16 03:26:53,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:26:53,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:26:53,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:26:53,423 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-16 03:26:53,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@210dbe4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:53, skipping insertion in model container [2023-02-16 03:26:53,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:26:53,425 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:26:53,427 INFO L158 Benchmark]: Toolchain (without parser) took 378.11ms. Allocated memory is still 153.1MB. Free memory was 115.8MB in the beginning and 101.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:26:53,427 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:26:53,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.05ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 101.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 03:26:53,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.05ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 101.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.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 d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:26:55,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:26:55,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:26:55,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:26:55,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:26:55,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:26:55,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:26:55,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:26:55,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:26:55,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:26:55,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:26:55,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:26:55,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:26:55,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:26:55,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:26:55,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:26:55,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:26:55,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:26:55,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:26:55,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:26:55,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:26:55,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:26:55,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:26:55,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:26:55,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:26:55,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:26:55,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:26:55,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:26:55,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:26:55,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:26:55,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:26:55,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:26:55,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:26:55,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:26:55,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:26:55,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:26:55,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:26:55,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:26:55,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:26:55,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:26:55,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:26:55,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:26:55,356 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:26:55,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:26:55,358 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:26:55,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:26:55,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:26:55,359 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:26:55,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:26:55,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:26:55,360 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:26:55,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:26:55,361 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:26:55,361 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:26:55,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:26:55,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:26:55,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:26:55,363 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:26:55,363 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:26:55,363 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:26:55,363 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:26:55,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:26:55,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:26:55,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:26:55,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:26:55,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:26:55,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:26:55,365 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:26:55,365 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:26:55,365 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:26:55,365 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:26:55,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:26:55,366 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:26:55,366 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:26:55,366 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d2e5061cdab54d9faeb4b87debefa6d4cd511c313e4ad95bcaf137fbc78127a3 [2023-02-16 03:26:55,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:26:55,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:26:55,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:26:55,678 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:26:55,679 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:26:55,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-16 03:26:56,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:26:57,048 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:26:57,052 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2023-02-16 03:26:57,068 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990c12b77/f9cddd55c40b4ed8af24300ac9a93ce7/FLAGfc104078f [2023-02-16 03:26:57,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990c12b77/f9cddd55c40b4ed8af24300ac9a93ce7 [2023-02-16 03:26:57,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:26:57,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:26:57,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:26:57,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:26:57,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:26:57,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9a669a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57, skipping insertion in model container [2023-02-16 03:26:57,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:26:57,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:26:57,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:26:57,588 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:26:57,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:26:57,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:26:57,655 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:26:57,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:26:57,771 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:26:57,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57 WrapperNode [2023-02-16 03:26:57,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:26:57,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:26:57,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:26:57,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:26:57,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,841 INFO L138 Inliner]: procedures = 176, calls = 104, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 171 [2023-02-16 03:26:57,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:26:57,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:26:57,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:26:57,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:26:57,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:26:57,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:26:57,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:26:57,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:26:57,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (1/1) ... [2023-02-16 03:26:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:26:57,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:26:57,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:26:57,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:26:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-16 03:26:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-16 03:26:57,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2023-02-16 03:26:57,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:26:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-16 03:26:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:26:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:26:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:26:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:26:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:26:58,182 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:26:58,184 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:26:58,619 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:26:58,625 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:26:58,625 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 03:26:58,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:26:58 BoogieIcfgContainer [2023-02-16 03:26:58,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:26:58,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:26:58,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:26:58,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:26:58,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:26:57" (1/3) ... [2023-02-16 03:26:58,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1d44bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:26:58, skipping insertion in model container [2023-02-16 03:26:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:26:57" (2/3) ... [2023-02-16 03:26:58,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1d44bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:26:58, skipping insertion in model container [2023-02-16 03:26:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:26:58" (3/3) ... [2023-02-16 03:26:58,635 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-2.i [2023-02-16 03:26:58,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:26:58,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-02-16 03:26:58,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:26:58,696 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36eb62ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:26:58,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-02-16 03:26:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 127 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:26:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:26:58,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:58,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:58,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:26:58,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1983254393, now seen corresponding path program 1 times [2023-02-16 03:26:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712195079] [2023-02-16 03:26:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:58,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:26:58,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:26:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:58,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:26:58,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:26:58,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:26:58,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:58,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712195079] [2023-02-16 03:26:58,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712195079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:26:58,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:26:58,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:26:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855396245] [2023-02-16 03:26:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:58,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:26:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:26:58,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:26:58,972 INFO L87 Difference]: Start difference. First operand has 135 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 127 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:26:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:59,092 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2023-02-16 03:26:59,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:26:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-16 03:26:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:59,103 INFO L225 Difference]: With dead ends: 257 [2023-02-16 03:26:59,103 INFO L226 Difference]: Without dead ends: 253 [2023-02-16 03:26:59,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:26:59,108 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 124 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:59,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 568 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:26:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-02-16 03:26:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 137. [2023-02-16 03:26:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.759493670886076) internal successors, (139), 128 states have internal predecessors, (139), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:26:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2023-02-16 03:26:59,148 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 11 [2023-02-16 03:26:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2023-02-16 03:26:59,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:26:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2023-02-16 03:26:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:26:59,150 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:59,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:59,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:26:59,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:59,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:26:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:26:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1095750712, now seen corresponding path program 1 times [2023-02-16 03:26:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:26:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453667618] [2023-02-16 03:26:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:26:59,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:26:59,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:26:59,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:26:59,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 03:26:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:26:59,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:26:59,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:26:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:26:59,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:26:59,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:26:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453667618] [2023-02-16 03:26:59,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453667618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:26:59,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:26:59,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:26:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899007334] [2023-02-16 03:26:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:26:59,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:26:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:26:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:26:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:26:59,452 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:26:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:26:59,848 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2023-02-16 03:26:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:26:59,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-16 03:26:59,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:26:59,851 INFO L225 Difference]: With dead ends: 226 [2023-02-16 03:26:59,851 INFO L226 Difference]: Without dead ends: 224 [2023-02-16 03:26:59,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:26:59,852 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 92 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:26:59,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 436 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:26:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-16 03:26:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 133. [2023-02-16 03:26:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 125 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:26:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-16 03:26:59,862 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2023-02-16 03:26:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:26:59,862 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-16 03:26:59,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:26:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-16 03:26:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:26:59,863 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:26:59,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:26:59,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:00,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,075 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1690514833, now seen corresponding path program 1 times [2023-02-16 03:27:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:00,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257435948] [2023-02-16 03:27:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:00,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:00,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 03:27:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:00,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:00,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:00,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:00,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257435948] [2023-02-16 03:27:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257435948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:00,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574390148] [2023-02-16 03:27:00,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:00,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:00,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:00,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:00,224 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:27:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:00,347 INFO L93 Difference]: Finished difference Result 250 states and 276 transitions. [2023-02-16 03:27:00,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-02-16 03:27:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:00,349 INFO L225 Difference]: With dead ends: 250 [2023-02-16 03:27:00,350 INFO L226 Difference]: Without dead ends: 250 [2023-02-16 03:27:00,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:00,351 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 119 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:00,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 531 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-16 03:27:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 137. [2023-02-16 03:27:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 128 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:27:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2023-02-16 03:27:00,360 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 17 [2023-02-16 03:27:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:00,360 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2023-02-16 03:27:00,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 03:27:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2023-02-16 03:27:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:27:00,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:00,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:00,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:00,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:00,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1719143984, now seen corresponding path program 1 times [2023-02-16 03:27:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052661504] [2023-02-16 03:27:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:00,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:00,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 03:27:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:00,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:27:00,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:00,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:00,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:00,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052661504] [2023-02-16 03:27:00,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052661504] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:00,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:00,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2023-02-16 03:27:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584954346] [2023-02-16 03:27:00,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:00,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:00,704 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:27:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:00,742 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2023-02-16 03:27:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-16 03:27:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:00,744 INFO L225 Difference]: With dead ends: 136 [2023-02-16 03:27:00,744 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 03:27:00,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:00,745 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 118 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:00,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 420 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 03:27:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-16 03:27:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.7341772151898733) internal successors, (137), 127 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-16 03:27:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2023-02-16 03:27:00,752 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 17 [2023-02-16 03:27:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:00,753 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2023-02-16 03:27:00,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:27:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2023-02-16 03:27:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 03:27:00,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:00,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:00,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:00,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1753856167, now seen corresponding path program 1 times [2023-02-16 03:27:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149677976] [2023-02-16 03:27:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:00,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:00,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:00,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 03:27:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:01,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:27:01,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:27:01,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:01,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:01,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149677976] [2023-02-16 03:27:01,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149677976] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:01,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:01,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:27:01,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153237964] [2023-02-16 03:27:01,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:01,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:27:01,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:01,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:27:01,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:01,285 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:01,651 INFO L93 Difference]: Finished difference Result 348 states and 384 transitions. [2023-02-16 03:27:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:27:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-16 03:27:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:01,654 INFO L225 Difference]: With dead ends: 348 [2023-02-16 03:27:01,654 INFO L226 Difference]: Without dead ends: 348 [2023-02-16 03:27:01,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:27:01,655 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 678 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:01,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 543 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:27:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-16 03:27:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 165. [2023-02-16 03:27:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 151 states have internal predecessors, (183), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2023-02-16 03:27:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2023-02-16 03:27:01,663 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 18 [2023-02-16 03:27:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:01,664 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2023-02-16 03:27:01,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2023-02-16 03:27:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:27:01,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:01,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:01,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:01,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:01,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1465033454, now seen corresponding path program 1 times [2023-02-16 03:27:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:01,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423787400] [2023-02-16 03:27:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:01,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:01,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:27:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:01,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:01,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:01,951 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:27:01,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:27:02,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423787400] [2023-02-16 03:27:02,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423787400] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:02,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:02,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-16 03:27:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503295796] [2023-02-16 03:27:02,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:02,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:02,100 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:03,860 INFO L93 Difference]: Finished difference Result 233 states and 278 transitions. [2023-02-16 03:27:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:27:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-02-16 03:27:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:03,866 INFO L225 Difference]: With dead ends: 233 [2023-02-16 03:27:03,866 INFO L226 Difference]: Without dead ends: 233 [2023-02-16 03:27:03,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:03,867 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 111 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:03,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 389 Invalid, 2 Unknown, 0 Unchecked, 1.7s Time] [2023-02-16 03:27:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-16 03:27:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 179. [2023-02-16 03:27:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 163 states have internal predecessors, (206), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2023-02-16 03:27:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2023-02-16 03:27:03,884 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 19 [2023-02-16 03:27:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:03,885 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2023-02-16 03:27:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2023-02-16 03:27:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:27:03,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:03,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:03,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-16 03:27:04,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:04,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 42518355, now seen corresponding path program 1 times [2023-02-16 03:27:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393946404] [2023-02-16 03:27:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:04,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:04,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:04,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 03:27:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:04,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:27:04,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:04,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:04,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393946404] [2023-02-16 03:27:04,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393946404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:04,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:04,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223016008] [2023-02-16 03:27:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:04,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:04,187 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:27:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:04,216 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-02-16 03:27:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-16 03:27:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:04,217 INFO L225 Difference]: With dead ends: 143 [2023-02-16 03:27:04,217 INFO L226 Difference]: Without dead ends: 139 [2023-02-16 03:27:04,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:04,222 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:04,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-16 03:27:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-02-16 03:27:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 129 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-16 03:27:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2023-02-16 03:27:04,227 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 19 [2023-02-16 03:27:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:04,228 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2023-02-16 03:27:04,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:27:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2023-02-16 03:27:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:27:04,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:04,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:04,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:04,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:04,441 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 204799578, now seen corresponding path program 1 times [2023-02-16 03:27:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:04,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662719482] [2023-02-16 03:27:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:04,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:04,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:04,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:04,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 03:27:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:04,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:27:04,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:04,513 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:04,550 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-16 03:27:04,569 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:27:04,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-16 03:27:04,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:04,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:04,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662719482] [2023-02-16 03:27:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662719482] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:04,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:04,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-16 03:27:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117306549] [2023-02-16 03:27:04,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:27:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:04,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:27:04,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:27:04,698 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:05,137 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2023-02-16 03:27:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:27:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-02-16 03:27:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:05,140 INFO L225 Difference]: With dead ends: 177 [2023-02-16 03:27:05,140 INFO L226 Difference]: Without dead ends: 177 [2023-02-16 03:27:05,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-16 03:27:05,141 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 106 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:05,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 433 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 188 Unchecked, 0.4s Time] [2023-02-16 03:27:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-16 03:27:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2023-02-16 03:27:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 101 states have (on average 1.6633663366336633) internal successors, (168), 144 states have internal predecessors, (168), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-16 03:27:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2023-02-16 03:27:05,145 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 22 [2023-02-16 03:27:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:05,146 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2023-02-16 03:27:05,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2023-02-16 03:27:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:27:05,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:05,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:05,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:05,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:05,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 204799579, now seen corresponding path program 1 times [2023-02-16 03:27:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834725856] [2023-02-16 03:27:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:05,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:05,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:05,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 03:27:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:05,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:27:05,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:05,441 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:05,445 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:27:05,561 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:05,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:05,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:05,595 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:05,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:27:05,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:05,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:05,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834725856] [2023-02-16 03:27:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834725856] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:05,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390148627] [2023-02-16 03:27:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:05,772 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:05,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-16 03:27:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:05,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 03:27:05,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:05,883 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:05,889 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:27:05,936 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_45 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_45))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:05,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:05,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:05,962 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:05,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-16 03:27:05,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:06,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1390148627] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:06,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:06,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-16 03:27:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371208844] [2023-02-16 03:27:06,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:06,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:27:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:27:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=71, Unknown=2, NotChecked=34, Total=132 [2023-02-16 03:27:06,082 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:07,037 INFO L93 Difference]: Finished difference Result 292 states and 331 transitions. [2023-02-16 03:27:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:07,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-02-16 03:27:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:07,039 INFO L225 Difference]: With dead ends: 292 [2023-02-16 03:27:07,039 INFO L226 Difference]: Without dead ends: 292 [2023-02-16 03:27:07,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=105, Unknown=2, NotChecked=42, Total=182 [2023-02-16 03:27:07,040 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 249 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:07,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 824 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 645 Invalid, 0 Unknown, 403 Unchecked, 0.8s Time] [2023-02-16 03:27:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-16 03:27:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 226. [2023-02-16 03:27:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 170 states have (on average 1.6823529411764706) internal successors, (286), 213 states have internal predecessors, (286), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-02-16 03:27:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 305 transitions. [2023-02-16 03:27:07,045 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 305 transitions. Word has length 22 [2023-02-16 03:27:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:07,046 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 305 transitions. [2023-02-16 03:27:07,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-16 03:27:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2023-02-16 03:27:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:27:07,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:07,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:07,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:07,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:07,455 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 852130837, now seen corresponding path program 1 times [2023-02-16 03:27:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:07,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978333696] [2023-02-16 03:27:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:07,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:07,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:07,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:07,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 03:27:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:07,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:27:07,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:07,643 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))))) is different from true [2023-02-16 03:27:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:07,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:07,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret53#1.base_19| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_19| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_19|))))) is different from false [2023-02-16 03:27:07,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978333696] [2023-02-16 03:27:07,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978333696] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1254097463] [2023-02-16 03:27:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:07,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:07,741 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-02-16 03:27:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:07,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:27:07,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:08,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:08,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret53#1.base_22| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_22|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret53#1.base_22| (_ bv0 1))))) is different from false [2023-02-16 03:27:08,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1254097463] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:08,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:08,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-16 03:27:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995594389] [2023-02-16 03:27:08,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:08,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:27:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:27:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-16 03:27:08,091 INFO L87 Difference]: Start difference. First operand 226 states and 305 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:08,944 INFO L93 Difference]: Finished difference Result 300 states and 384 transitions. [2023-02-16 03:27:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:27:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-16 03:27:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:08,946 INFO L225 Difference]: With dead ends: 300 [2023-02-16 03:27:08,946 INFO L226 Difference]: Without dead ends: 295 [2023-02-16 03:27:08,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-16 03:27:08,947 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 282 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:08,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 813 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 641 Invalid, 1 Unknown, 222 Unchecked, 0.7s Time] [2023-02-16 03:27:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-16 03:27:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2023-02-16 03:27:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 167 states have (on average 1.688622754491018) internal successors, (282), 210 states have internal predecessors, (282), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2023-02-16 03:27:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 301 transitions. [2023-02-16 03:27:08,953 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 301 transitions. Word has length 21 [2023-02-16 03:27:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:08,953 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 301 transitions. [2023-02-16 03:27:08,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:27:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 301 transitions. [2023-02-16 03:27:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:27:08,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:08,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:08,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:09,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:09,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:09,354 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1592151781, now seen corresponding path program 1 times [2023-02-16 03:27:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:09,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664675348] [2023-02-16 03:27:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:09,356 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:09,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 03:27:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:09,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:09,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:09,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:09,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:09,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664675348] [2023-02-16 03:27:09,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664675348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:09,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:09,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672813681] [2023-02-16 03:27:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:09,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:27:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:27:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:09,456 INFO L87 Difference]: Start difference. First operand 223 states and 301 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:09,490 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2023-02-16 03:27:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:27:09,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-02-16 03:27:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:09,491 INFO L225 Difference]: With dead ends: 144 [2023-02-16 03:27:09,491 INFO L226 Difference]: Without dead ends: 142 [2023-02-16 03:27:09,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:09,492 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:09,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:27:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-16 03:27:09,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-02-16 03:27:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.6) internal successors, (152), 133 states have internal predecessors, (152), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2023-02-16 03:27:09,496 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 22 [2023-02-16 03:27:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:09,497 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2023-02-16 03:27:09,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:27:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2023-02-16 03:27:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:27:09,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:09,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:09,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:09,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:09,705 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2097726863, now seen corresponding path program 1 times [2023-02-16 03:27:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:09,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320339002] [2023-02-16 03:27:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:09,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:09,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:09,707 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:09,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-16 03:27:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:09,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:09,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:09,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:09,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-16 03:27:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:09,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:09,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:09,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320339002] [2023-02-16 03:27:09,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320339002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:09,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:09,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582135376] [2023-02-16 03:27:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:09,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:27:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:27:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:27:09,821 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:09,947 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-02-16 03:27:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:09,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-16 03:27:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:09,949 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:27:09,949 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:27:09,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:09,950 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 611 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:27:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2023-02-16 03:27:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 99 states have (on average 1.5757575757575757) internal successors, (156), 136 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2023-02-16 03:27:09,957 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 27 [2023-02-16 03:27:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:09,957 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2023-02-16 03:27:09,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2023-02-16 03:27:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:27:09,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:09,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:09,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:10,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:10,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2097724533, now seen corresponding path program 1 times [2023-02-16 03:27:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:10,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055425244] [2023-02-16 03:27:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:10,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-16 03:27:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:10,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:27:10,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:10,254 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:27:10,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:10,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:10,333 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-16 03:27:10,337 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 9 [2023-02-16 03:27:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 03:27:10,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:10,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:10,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055425244] [2023-02-16 03:27:10,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055425244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:10,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:10,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:10,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199656755] [2023-02-16 03:27:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:10,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:27:10,353 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:10,714 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-02-16 03:27:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:27:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-16 03:27:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:10,716 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:27:10,716 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:27:10,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:10,717 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 9 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:10,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 609 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:27:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:27:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2023-02-16 03:27:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5742574257425743) internal successors, (159), 138 states have internal predecessors, (159), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2023-02-16 03:27:10,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 27 [2023-02-16 03:27:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:10,720 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2023-02-16 03:27:10,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2023-02-16 03:27:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:27:10,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:10,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:10,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:10,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:10,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:10,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2097724532, now seen corresponding path program 1 times [2023-02-16 03:27:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:10,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533570422] [2023-02-16 03:27:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:10,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:10,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:10,936 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:10,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-16 03:27:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:11,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 03:27:11,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:11,012 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:11,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:11,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-16 03:27:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:11,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:11,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:11,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533570422] [2023-02-16 03:27:11,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533570422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:11,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:11,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:27:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988145729] [2023-02-16 03:27:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:11,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:27:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:27:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:27:11,062 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:11,320 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2023-02-16 03:27:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-16 03:27:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:11,322 INFO L225 Difference]: With dead ends: 148 [2023-02-16 03:27:11,322 INFO L226 Difference]: Without dead ends: 148 [2023-02-16 03:27:11,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:11,323 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:11,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 461 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:27:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-16 03:27:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-16 03:27:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.5643564356435644) internal successors, (158), 138 states have internal predecessors, (158), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2023-02-16 03:27:11,326 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 27 [2023-02-16 03:27:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:11,327 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2023-02-16 03:27:11,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2023-02-16 03:27:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:27:11,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:11,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:11,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:11,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:11,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 290272400, now seen corresponding path program 1 times [2023-02-16 03:27:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:11,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767053035] [2023-02-16 03:27:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:11,539 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:11,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-16 03:27:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:11,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:27:11,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 03:27:11,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:11,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:11,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767053035] [2023-02-16 03:27:11,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767053035] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:11,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:11,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-16 03:27:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632628420] [2023-02-16 03:27:11,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:11,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:27:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:27:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:11,870 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:12,108 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2023-02-16 03:27:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-02-16 03:27:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:12,110 INFO L225 Difference]: With dead ends: 147 [2023-02-16 03:27:12,110 INFO L226 Difference]: Without dead ends: 147 [2023-02-16 03:27:12,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:27:12,110 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 317 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:12,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 535 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:27:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-16 03:27:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-02-16 03:27:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 137 states have internal predecessors, (156), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2023-02-16 03:27:12,114 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 27 [2023-02-16 03:27:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:12,115 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2023-02-16 03:27:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2023-02-16 03:27:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:27:12,116 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:12,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:12,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:12,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:12,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:12,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 290270070, now seen corresponding path program 1 times [2023-02-16 03:27:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:12,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137907941] [2023-02-16 03:27:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:12,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:12,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:12,328 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-16 03:27:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:12,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:27:12,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:12,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:12,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:12,462 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-16 03:27:12,468 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-16 03:27:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:12,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:12,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:12,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137907941] [2023-02-16 03:27:12,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137907941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:12,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:12,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:27:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053223821] [2023-02-16 03:27:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:12,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:27:12,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:27:12,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:27:12,481 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:12,618 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2023-02-16 03:27:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:12,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-16 03:27:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:12,620 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:27:12,620 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:27:12,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:27:12,621 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 12 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:12,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 647 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:27:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2023-02-16 03:27:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.5252525252525253) internal successors, (151), 133 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-16 03:27:12,625 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 27 [2023-02-16 03:27:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-16 03:27:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-16 03:27:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:27:12,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:12,626 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:12,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:12,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:12,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1573614038, now seen corresponding path program 1 times [2023-02-16 03:27:12,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:12,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427096980] [2023-02-16 03:27:12,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:12,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:12,837 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:12,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-16 03:27:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:12,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:27:12,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:12,936 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:27:12,940 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:13,045 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_160 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_160))) (exists ((v_ArrVal_159 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_159))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:13,074 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:13,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:13,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:13,110 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_161 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_161))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-16 03:27:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:13,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:13,131 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:13,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-16 03:27:13,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:13,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427096980] [2023-02-16 03:27:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427096980] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1862274216] [2023-02-16 03:27:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:13,375 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:13,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-16 03:27:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:13,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 03:27:13,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:13,531 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:27:13,535 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:13,581 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_186 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_186))) (exists ((v_ArrVal_185 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_185))))) is different from true [2023-02-16 03:27:13,618 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:13,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:13,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:13,659 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_187 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_187))))) is different from true [2023-02-16 03:27:13,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:27:13,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:27:13,679 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:27:13,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:27:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-16 03:27:13,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:13,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1862274216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:13,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:13,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2023-02-16 03:27:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065250265] [2023-02-16 03:27:13,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:13,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:27:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:13,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:27:13,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=73, Unknown=4, NotChecked=76, Total=182 [2023-02-16 03:27:13,837 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:14,384 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2023-02-16 03:27:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2023-02-16 03:27:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:14,386 INFO L225 Difference]: With dead ends: 166 [2023-02-16 03:27:14,386 INFO L226 Difference]: Without dead ends: 166 [2023-02-16 03:27:14,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2023-02-16 03:27:14,387 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 156 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:14,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 335 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 404 Invalid, 0 Unknown, 685 Unchecked, 0.5s Time] [2023-02-16 03:27:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-16 03:27:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2023-02-16 03:27:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.5151515151515151) internal successors, (150), 132 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-16 03:27:14,390 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 29 [2023-02-16 03:27:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:14,391 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-16 03:27:14,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-16 03:27:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-16 03:27:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:27:14,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:14,392 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:14,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:14,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:14,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:14,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 414602102, now seen corresponding path program 1 times [2023-02-16 03:27:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324243240] [2023-02-16 03:27:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:14,799 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-16 03:27:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:14,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:27:14,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:27:14,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:27:14,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324243240] [2023-02-16 03:27:14,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324243240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:27:14,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:27:14,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:27:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102626398] [2023-02-16 03:27:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:27:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:27:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:27:14,903 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:15,037 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2023-02-16 03:27:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:27:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-16 03:27:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:15,039 INFO L225 Difference]: With dead ends: 165 [2023-02-16 03:27:15,039 INFO L226 Difference]: Without dead ends: 165 [2023-02-16 03:27:15,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:27:15,039 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 155 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:15,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 200 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:27:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-16 03:27:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-16 03:27:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.505050505050505) internal successors, (149), 131 states have internal predecessors, (149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2023-02-16 03:27:15,043 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 31 [2023-02-16 03:27:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:15,043 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2023-02-16 03:27:15,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2023-02-16 03:27:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:27:15,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:15,044 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:15,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-02-16 03:27:15,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:15,254 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 414602103, now seen corresponding path program 1 times [2023-02-16 03:27:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:15,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858915840] [2023-02-16 03:27:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:15,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:15,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:15,257 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:15,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-16 03:27:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:15,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:27:15,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:15,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:15,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-02-16 03:27:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:15,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:15,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858915840] [2023-02-16 03:27:15,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858915840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:15,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:15,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-16 03:27:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868694902] [2023-02-16 03:27:15,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:15,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:27:15,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:27:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:27:15,620 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:16,036 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2023-02-16 03:27:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:27:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2023-02-16 03:27:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:16,037 INFO L225 Difference]: With dead ends: 147 [2023-02-16 03:27:16,037 INFO L226 Difference]: Without dead ends: 147 [2023-02-16 03:27:16,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:27:16,038 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 374 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:16,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 387 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:27:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-16 03:27:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2023-02-16 03:27:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.494949494949495) internal successors, (148), 130 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2023-02-16 03:27:16,041 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 159 transitions. Word has length 31 [2023-02-16 03:27:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:16,042 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 159 transitions. [2023-02-16 03:27:16,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-16 03:27:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 159 transitions. [2023-02-16 03:27:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:27:16,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:16,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:16,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:16,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:16,252 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2015159051, now seen corresponding path program 1 times [2023-02-16 03:27:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:16,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127147053] [2023-02-16 03:27:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:16,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:16,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:16,254 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:16,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-16 03:27:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:16,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:27:16,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:16,333 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:16,401 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:16,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:16,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:27:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:16,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:16,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:16,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127147053] [2023-02-16 03:27:16,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127147053] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:16,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:16,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2023-02-16 03:27:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793104803] [2023-02-16 03:27:16,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:16,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:27:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:27:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:27:16,702 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:27:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:17,171 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2023-02-16 03:27:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:17,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2023-02-16 03:27:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:17,172 INFO L225 Difference]: With dead ends: 167 [2023-02-16 03:27:17,173 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 03:27:17,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:27:17,174 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 178 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:17,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 439 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:27:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 03:27:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2023-02-16 03:27:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 133 states have internal predecessors, (151), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2023-02-16 03:27:17,180 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 31 [2023-02-16 03:27:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:17,180 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2023-02-16 03:27:17,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-16 03:27:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2023-02-16 03:27:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:27:17,181 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:17,181 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:17,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:17,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:17,390 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -999337641, now seen corresponding path program 1 times [2023-02-16 03:27:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:17,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7667682] [2023-02-16 03:27:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:17,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:17,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:17,392 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:17,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-16 03:27:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:17,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:27:17,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:17,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:17,576 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-16 03:27:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:17,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:27:17,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7667682] [2023-02-16 03:27:17,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7667682] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:17,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:27:17,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2023-02-16 03:27:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140513825] [2023-02-16 03:27:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:27:17,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:27:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:27:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:27:17,694 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:18,098 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2023-02-16 03:27:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:27:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-02-16 03:27:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:18,099 INFO L225 Difference]: With dead ends: 203 [2023-02-16 03:27:18,099 INFO L226 Difference]: Without dead ends: 203 [2023-02-16 03:27:18,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:27:18,100 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 339 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:18,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 403 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:27:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-16 03:27:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 142. [2023-02-16 03:27:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 132 states have internal predecessors, (150), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2023-02-16 03:27:18,103 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 33 [2023-02-16 03:27:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:18,104 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2023-02-16 03:27:18,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:27:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2023-02-16 03:27:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:27:18,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:18,104 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:18,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:18,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:18,309 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash -999337640, now seen corresponding path program 1 times [2023-02-16 03:27:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:18,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325140132] [2023-02-16 03:27:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:18,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:18,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:18,311 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:18,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-16 03:27:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:18,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:27:18,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:18,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:18,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:18,574 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 9 [2023-02-16 03:27:18,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:27:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:18,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:18,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-02-16 03:27:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:19,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:19,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325140132] [2023-02-16 03:27:19,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325140132] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:27:19,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:19,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-02-16 03:27:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130193818] [2023-02-16 03:27:19,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:19,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 03:27:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 03:27:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-02-16 03:27:19,025 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:27:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:20,133 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2023-02-16 03:27:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:27:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2023-02-16 03:27:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:20,135 INFO L225 Difference]: With dead ends: 196 [2023-02-16 03:27:20,135 INFO L226 Difference]: Without dead ends: 196 [2023-02-16 03:27:20,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-02-16 03:27:20,136 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 849 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:20,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 746 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 03:27:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-16 03:27:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 141. [2023-02-16 03:27:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 131 states have internal predecessors, (149), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:27:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2023-02-16 03:27:20,140 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 33 [2023-02-16 03:27:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:20,140 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2023-02-16 03:27:20,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:27:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2023-02-16 03:27:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 03:27:20,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:20,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:27:20,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:20,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:20,351 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 462409528, now seen corresponding path program 1 times [2023-02-16 03:27:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:20,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207674184] [2023-02-16 03:27:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:20,353 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:20,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-16 03:27:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:20,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:27:20,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:26,668 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_323 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~intf~2#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| v_ArrVal_323))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= |c_#valid| (store (store .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 1)) |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1)))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)))) is different from true [2023-02-16 03:27:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:26,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:28,851 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret54#1.base_36| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret54#1.base_36| (_ bv0 1)) |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret54#1.base_36|))))) is different from false [2023-02-16 03:27:28,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:28,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207674184] [2023-02-16 03:27:28,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207674184] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:28,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [823798460] [2023-02-16 03:27:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:28,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:28,857 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:28,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-16 03:27:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:29,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:27:29,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:35,558 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((v_ArrVal_323 (_ BitVec 1)) (|ULTIMATE.start_entry_point_~hdev~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_entry_point_~intf~2#1.base| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base| v_ArrVal_323))) (let ((.cse1 (store .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse0 |ULTIMATE.start_entry_point_~intf~2#1.base|)) (= |c_#valid| (store .cse1 |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse1 |ULTIMATE.start_entry_point_~hdev~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~hdev~0#1.base|)) (not (= |ULTIMATE.start_entry_point_~hdev~0#1.base| (_ bv0 32)))))))) is different from true [2023-02-16 03:27:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:27:35,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:35,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-02-16 03:27:40,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [823798460] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:40,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:27:40,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-16 03:27:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595328420] [2023-02-16 03:27:40,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:27:40,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:27:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:27:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:27:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=12, NotChecked=162, Total=930 [2023-02-16 03:27:40,281 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:27:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:27:45,661 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2023-02-16 03:27:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:27:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2023-02-16 03:27:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:27:45,663 INFO L225 Difference]: With dead ends: 143 [2023-02-16 03:27:45,663 INFO L226 Difference]: Without dead ends: 129 [2023-02-16 03:27:45,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=12, NotChecked=228, Total=1722 [2023-02-16 03:27:45,664 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 125 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:27:45,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 666 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 650 Invalid, 0 Unknown, 250 Unchecked, 0.9s Time] [2023-02-16 03:27:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-16 03:27:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2023-02-16 03:27:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 119 states have internal predecessors, (135), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:27:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-02-16 03:27:45,667 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 33 [2023-02-16 03:27:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:27:45,667 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-02-16 03:27:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:27:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-02-16 03:27:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:27:45,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:27:45,668 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:27:45,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-16 03:27:45,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-16 03:27:46,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:46,077 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:27:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:27:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -914695768, now seen corresponding path program 1 times [2023-02-16 03:27:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:27:46,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415542488] [2023-02-16 03:27:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:46,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:27:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:27:46,079 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:27:46,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-16 03:27:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:46,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 03:27:46,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:46,187 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:46,273 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:46,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:46,405 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:27:46,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:27:46,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:46,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:27:46,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-16 03:27:46,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:46,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-02-16 03:27:46,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:27:46,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:46,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2023-02-16 03:27:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:47,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:47,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_380))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:27:47,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1) v_ArrVal_380))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32)) |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-16 03:27:47,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:47,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2023-02-16 03:27:47,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:47,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 288 [2023-02-16 03:27:47,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 284 [2023-02-16 03:27:47,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2023-02-16 03:27:48,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2023-02-16 03:27:55,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:27:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415542488] [2023-02-16 03:27:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415542488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:27:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [38529105] [2023-02-16 03:27:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:27:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:27:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:27:55,875 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:27:55,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-16 03:27:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:27:56,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 03:27:56,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:27:56,072 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:27:56,116 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:27:56,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:27:56,191 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-16 03:27:56,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-16 03:27:56,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:56,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:27:56,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-16 03:27:56,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-02-16 03:27:56,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:27:56,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:27:56,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:56,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 33 [2023-02-16 03:27:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:27:56,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:27:57,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:57,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2023-02-16 03:27:57,399 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:27:57,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 382 [2023-02-16 03:27:57,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 398 [2023-02-16 03:27:57,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2023-02-16 03:28:09,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1311 treesize of output 1279 [2023-02-16 03:28:22,033 WARN L233 SmtUtils]: Spent 7.43s on a formula simplification. DAG size of input: 48 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:28:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [38529105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:28:22,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:28:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2023-02-16 03:28:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338573928] [2023-02-16 03:28:22,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:28:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 03:28:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:28:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 03:28:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1075, Unknown=7, NotChecked=134, Total=1332 [2023-02-16 03:28:22,036 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:28:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:28:24,601 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2023-02-16 03:28:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:28:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-02-16 03:28:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:28:24,603 INFO L225 Difference]: With dead ends: 187 [2023-02-16 03:28:24,603 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 03:28:24,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=225, Invalid=1416, Unknown=7, NotChecked=158, Total=1806 [2023-02-16 03:28:24,604 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 382 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:28:24,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 793 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-16 03:28:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 03:28:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 126. [2023-02-16 03:28:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 118 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 03:28:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2023-02-16 03:28:24,608 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 34 [2023-02-16 03:28:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:28:24,609 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2023-02-16 03:28:24,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 15 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:28:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2023-02-16 03:28:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 03:28:24,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:28:24,610 INFO L195 NwaCegarLoop]: 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] [2023-02-16 03:28:24,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-02-16 03:28:24,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:28:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:28:25,017 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-02-16 03:28:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:28:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -914695767, now seen corresponding path program 1 times [2023-02-16 03:28:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:28:25,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498879445] [2023-02-16 03:28:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:28:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:28:25,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:28:25,019 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:28:25,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-16 03:28:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:28:25,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-16 03:28:25,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:28:25,130 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:28:25,211 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:28:25,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-16 03:28:25,292 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:28:25,334 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-16 03:28:25,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:28:25,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:28:25,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:28:25,584 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:28:25,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2023-02-16 03:28:25,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:28:25,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-16 03:28:25,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-16 03:28:25,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:28:25,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:28:25,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:28:25,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2023-02-16 03:28:25,946 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:28:25,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-16 03:28:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:28:25,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:28:26,937 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_453))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv7 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_453))) (store .cse5 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse5 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4) (_ bv8 32)) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem57#1.base| v_ArrVal_452))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse4)))))) is different from false [2023-02-16 03:28:27,117 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv4 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_entry_point_~intf~2#1.offset| (_ bv8 32))) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (and (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_453))) (store .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse1 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv7 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_452 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_453))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 .cse3))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5) (_ bv8 32)) (select |c_#length| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_452))) (store .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse7 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse2 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))))))) is different from false [2023-02-16 03:28:27,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:28:27,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 84 [2023-02-16 03:28:27,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:28:27,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2023-02-16 03:28:27,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:28:27,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 584 treesize of output 576 [2023-02-16 03:28:27,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:28:27,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3072 treesize of output 2982 [2023-02-16 03:28:27,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3458 treesize of output 3266 [2023-02-16 03:28:27,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3646 treesize of output 3446