./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --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.5-?-c7c6ca5-m [2024-11-09 07:50:01,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:50:01,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:50:01,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:50:01,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:50:01,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:50:01,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:50:01,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:50:01,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:50:01,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:50:01,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:50:01,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:50:01,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:50:01,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:50:01,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:50:01,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:50:01,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:50:01,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:50:01,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:50:01,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:50:01,576 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:50:01,577 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:50:01,577 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:50:01,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:50:01,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:50:01,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:50:01,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:50:01,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:50:01,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:50:01,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:50:01,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:50:01,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:50:01,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:50:01,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:50:01,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:50:01,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:50:01,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:50:01,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:50:01,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:50:01,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:50:01,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:50:01,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:50:01,583 INFO L153 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 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 [2024-11-09 07:50:01,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:50:01,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:50:01,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:50:01,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:50:01,850 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:50:01,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-09 07:50:03,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:50:03,514 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:50:03,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-09 07:50:03,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b884115b5/c75e8bb2bdc342948183c0ed914d436d/FLAGab63c686f [2024-11-09 07:50:03,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b884115b5/c75e8bb2bdc342948183c0ed914d436d [2024-11-09 07:50:03,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:50:03,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:50:03,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:50:03,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:50:03,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:50:03,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:50:03" (1/1) ... [2024-11-09 07:50:03,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4ac65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:03, skipping insertion in model container [2024-11-09 07:50:03,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:50:03" (1/1) ... [2024-11-09 07:50:03,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:50:03,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:04,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:04,054 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:04,054 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:04,055 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:04,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:50:04,078 ERROR L321 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) [2024-11-09 07:50:04,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@265ae783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:04, skipping insertion in model container [2024-11-09 07:50:04,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:50:04,080 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:50:04,081 INFO L158 Benchmark]: Toolchain (without parser) took 529.63ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 86.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:50:04,082 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:50:04,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.47ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 86.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:50:04,085 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.47ms. Allocated memory is still 163.6MB. Free memory was 103.7MB in the beginning and 86.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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: /root/.sdkman/candidates/java/11.0.12-open/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 --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.5-?-c7c6ca5-m [2024-11-09 07:50:06,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:50:06,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:50:06,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:50:06,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:50:06,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:50:06,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:50:06,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:50:06,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:50:06,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:50:06,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:50:06,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:50:06,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:50:06,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:50:06,188 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:50:06,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:50:06,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:50:06,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:50:06,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:50:06,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:50:06,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:50:06,193 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:50:06,193 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:50:06,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:50:06,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:50:06,194 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:50:06,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:50:06,194 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:50:06,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:50:06,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:50:06,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:50:06,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:50:06,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:50:06,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:50:06,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:50:06,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:50:06,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:50:06,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:50:06,197 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:50:06,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:06,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:50:06,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:50:06,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:50:06,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:50:06,198 INFO L153 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 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 [2024-11-09 07:50:06,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:50:06,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:50:06,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:50:06,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:50:06,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:50:06,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-09 07:50:08,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:50:08,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:50:08,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test15-2.i [2024-11-09 07:50:08,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166be0632/7122d2e5e152414e912c5ba7a56d992a/FLAG91565c90e [2024-11-09 07:50:08,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166be0632/7122d2e5e152414e912c5ba7a56d992a [2024-11-09 07:50:08,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:50:08,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:50:08,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:50:08,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:50:08,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:50:08,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:50:08" (1/1) ... [2024-11-09 07:50:08,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e86206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:08, skipping insertion in model container [2024-11-09 07:50:08,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:50:08" (1/1) ... [2024-11-09 07:50:08,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:50:08,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,825 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,835 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,836 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,836 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:50:08,858 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:50:08,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:50:08,901 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,932 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,932 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:50:08,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:50:08,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:50:09,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:50:09,055 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:50:09,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09 WrapperNode [2024-11-09 07:50:09,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:50:09,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:50:09,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:50:09,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:50:09,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,115 INFO L138 Inliner]: procedures = 176, calls = 104, calls flagged for inlining = 31, calls inlined = 14, statements flattened = 185 [2024-11-09 07:50:09,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:50:09,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:50:09,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:50:09,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:50:09,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,172 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2024-11-09 07:50:09,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:50:09,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:50:09,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:50:09,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:50:09,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (1/1) ... [2024-11-09 07:50:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:50:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:50:09,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:50:09,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:50:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:50:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:50:09,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:50:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2024-11-09 07:50:09,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2024-11-09 07:50:09,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:50:09,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:50:09,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 07:50:09,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:50:09,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:50:09,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:50:09,483 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:50:09,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:50:10,047 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-09 07:50:10,047 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:50:10,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:50:10,067 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:50:10,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:50:10 BoogieIcfgContainer [2024-11-09 07:50:10,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:50:10,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:50:10,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:50:10,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:50:10,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:50:08" (1/3) ... [2024-11-09 07:50:10,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412d3773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:50:10, skipping insertion in model container [2024-11-09 07:50:10,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:50:09" (2/3) ... [2024-11-09 07:50:10,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412d3773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:50:10, skipping insertion in model container [2024-11-09 07:50:10,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:50:10" (3/3) ... [2024-11-09 07:50:10,075 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test15-2.i [2024-11-09 07:50:10,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:50:10,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-09 07:50:10,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:50:10,132 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4539a7ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:50:10,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 07:50:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 128 states have internal predecessors, (139), 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) [2024-11-09 07:50:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:50:10,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:10,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:10,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash 505181993, now seen corresponding path program 1 times [2024-11-09 07:50:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717535271] [2024-11-09 07:50:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:10,160 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 [2024-11-09 07:50:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:10,163 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) [2024-11-09 07:50:10,179 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 [2024-11-09 07:50:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:10,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:10,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:10,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:10,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:10,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717535271] [2024-11-09 07:50:10,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717535271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206075838] [2024-11-09 07:50:10,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:10,419 INFO L87 Difference]: Start difference. First operand has 136 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 128 states have internal predecessors, (139), 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) [2024-11-09 07:50:10,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:10,528 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2024-11-09 07:50:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:10,531 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 [2024-11-09 07:50:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:10,548 INFO L225 Difference]: With dead ends: 251 [2024-11-09 07:50:10,548 INFO L226 Difference]: Without dead ends: 249 [2024-11-09 07:50:10,549 INFO L431 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 [2024-11-09 07:50:10,552 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 116 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:10,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 551 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-09 07:50:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 138. [2024-11-09 07:50:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 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) [2024-11-09 07:50:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2024-11-09 07:50:10,594 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 11 [2024-11-09 07:50:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:10,594 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2024-11-09 07:50:10,595 INFO L472 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) [2024-11-09 07:50:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2024-11-09 07:50:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:50:10,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:10,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:10,599 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 (2)] Ended with exit code 0 [2024-11-09 07:50:10,796 WARN L453 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 [2024-11-09 07:50:10,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1392685674, now seen corresponding path program 1 times [2024-11-09 07:50:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951912231] [2024-11-09 07:50:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:10,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 [2024-11-09 07:50:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:10,801 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) [2024-11-09 07:50:10,802 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 [2024-11-09 07:50:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:10,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:10,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:10,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:10,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951912231] [2024-11-09 07:50:10,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951912231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:10,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:50:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144433334] [2024-11-09 07:50:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:50:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:50:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:50:10,912 INFO L87 Difference]: Start difference. First operand 138 states and 153 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) [2024-11-09 07:50:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:11,269 INFO L93 Difference]: Finished difference Result 228 states and 253 transitions. [2024-11-09 07:50:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:50:11,270 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 [2024-11-09 07:50:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:11,272 INFO L225 Difference]: With dead ends: 228 [2024-11-09 07:50:11,272 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 07:50:11,272 INFO L431 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 [2024-11-09 07:50:11,276 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 93 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:11,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 437 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:50:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 07:50:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 134. [2024-11-09 07:50:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 126 states have internal predecessors, (136), 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) [2024-11-09 07:50:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-09 07:50:11,307 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 11 [2024-11-09 07:50:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:11,308 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-09 07:50:11,308 INFO L472 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) [2024-11-09 07:50:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-09 07:50:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:50:11,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:11,309 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:11,315 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 (3)] Ended with exit code 0 [2024-11-09 07:50:11,509 WARN L453 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 [2024-11-09 07:50:11,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:11,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1151011886, now seen corresponding path program 1 times [2024-11-09 07:50:11,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625456441] [2024-11-09 07:50:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:11,512 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 [2024-11-09 07:50:11,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:11,516 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) [2024-11-09 07:50:11,518 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 [2024-11-09 07:50:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:11,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:11,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:11,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:11,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625456441] [2024-11-09 07:50:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625456441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:11,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046296111] [2024-11-09 07:50:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:11,630 INFO L87 Difference]: Start difference. First operand 134 states and 146 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) [2024-11-09 07:50:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:11,733 INFO L93 Difference]: Finished difference Result 234 states and 270 transitions. [2024-11-09 07:50:11,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:11,734 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 [2024-11-09 07:50:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:11,736 INFO L225 Difference]: With dead ends: 234 [2024-11-09 07:50:11,736 INFO L226 Difference]: Without dead ends: 234 [2024-11-09 07:50:11,737 INFO L431 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 [2024-11-09 07:50:11,739 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 101 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:11,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 501 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-09 07:50:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 138. [2024-11-09 07:50:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 80 states have (on average 1.7375) internal successors, (139), 129 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) [2024-11-09 07:50:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2024-11-09 07:50:11,761 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 17 [2024-11-09 07:50:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:11,761 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2024-11-09 07:50:11,761 INFO L472 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) [2024-11-09 07:50:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2024-11-09 07:50:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:50:11,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:11,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:11,770 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 (4)] Ended with exit code 0 [2024-11-09 07:50:11,966 WARN L453 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 [2024-11-09 07:50:11,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1122382735, now seen corresponding path program 1 times [2024-11-09 07:50:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311690229] [2024-11-09 07:50:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:11,969 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 [2024-11-09 07:50:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:11,972 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) [2024-11-09 07:50:11,973 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 [2024-11-09 07:50:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:12,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:50:12,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:12,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:12,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311690229] [2024-11-09 07:50:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311690229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:12,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-09 07:50:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237539554] [2024-11-09 07:50:12,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:12,128 INFO L87 Difference]: Start difference. First operand 138 states and 152 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) [2024-11-09 07:50:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:12,173 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2024-11-09 07:50:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:12,174 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 [2024-11-09 07:50:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:12,175 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:50:12,175 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:50:12,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:12,194 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 111 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:12,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 430 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:50:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-09 07:50:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.725) 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) [2024-11-09 07:50:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2024-11-09 07:50:12,207 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 17 [2024-11-09 07:50:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:12,208 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2024-11-09 07:50:12,208 INFO L472 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) [2024-11-09 07:50:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2024-11-09 07:50:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:50:12,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:12,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:12,215 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 [2024-11-09 07:50:12,413 WARN L453 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 [2024-11-09 07:50:12,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash -434126201, now seen corresponding path program 1 times [2024-11-09 07:50:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60553403] [2024-11-09 07:50:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:12,415 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 [2024-11-09 07:50:12,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:12,418 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) [2024-11-09 07:50:12,420 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 [2024-11-09 07:50:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:12,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:50:12,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:12,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:12,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60553403] [2024-11-09 07:50:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60553403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:12,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:50:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952826395] [2024-11-09 07:50:12,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:50:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:50:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:50:12,822 INFO L87 Difference]: Start difference. First operand 137 states and 151 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) [2024-11-09 07:50:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:13,234 INFO L93 Difference]: Finished difference Result 346 states and 385 transitions. [2024-11-09 07:50:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:50:13,235 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 [2024-11-09 07:50:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:13,236 INFO L225 Difference]: With dead ends: 346 [2024-11-09 07:50:13,236 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 07:50:13,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:50:13,237 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 667 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:13,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 659 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:50:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 07:50:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 167. [2024-11-09 07:50:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 153 states have internal predecessors, (185), 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) [2024-11-09 07:50:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2024-11-09 07:50:13,252 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 18 [2024-11-09 07:50:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:13,252 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2024-11-09 07:50:13,252 INFO L472 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) [2024-11-09 07:50:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2024-11-09 07:50:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:50:13,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:13,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:13,257 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 (6)] Ended with exit code 0 [2024-11-09 07:50:13,454 WARN L453 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 [2024-11-09 07:50:13,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -573010125, now seen corresponding path program 1 times [2024-11-09 07:50:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910660634] [2024-11-09 07:50:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:13,455 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 [2024-11-09 07:50:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:13,457 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) [2024-11-09 07:50:13,457 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 [2024-11-09 07:50:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:13,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:13,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:13,536 INFO L378 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 [2024-11-09 07:50:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:13,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:13,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:13,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910660634] [2024-11-09 07:50:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910660634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:13,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-11-09 07:50:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215957337] [2024-11-09 07:50:13,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:50:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:50:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:13,722 INFO L87 Difference]: Start difference. First operand 167 states and 206 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) [2024-11-09 07:50:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:14,167 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2024-11-09 07:50:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:14,168 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 [2024-11-09 07:50:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:14,169 INFO L225 Difference]: With dead ends: 235 [2024-11-09 07:50:14,169 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 07:50:14,170 INFO L431 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 [2024-11-09 07:50:14,170 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 117 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:14,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 361 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:50:14,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 07:50:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 182. [2024-11-09 07:50:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.7416666666666667) internal successors, (209), 166 states have internal predecessors, (209), 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) [2024-11-09 07:50:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 233 transitions. [2024-11-09 07:50:14,182 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 233 transitions. Word has length 19 [2024-11-09 07:50:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:14,182 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 233 transitions. [2024-11-09 07:50:14,183 INFO L472 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) [2024-11-09 07:50:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 233 transitions. [2024-11-09 07:50:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:50:14,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:14,184 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:14,188 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 [2024-11-09 07:50:14,387 WARN L453 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 [2024-11-09 07:50:14,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:14,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 934541684, now seen corresponding path program 1 times [2024-11-09 07:50:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95614261] [2024-11-09 07:50:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:14,389 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 [2024-11-09 07:50:14,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:14,390 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) [2024-11-09 07:50:14,391 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 [2024-11-09 07:50:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:14,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:14,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:50:14,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:14,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:14,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95614261] [2024-11-09 07:50:14,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95614261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:14,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:14,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:14,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24235104] [2024-11-09 07:50:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:14,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:14,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:14,496 INFO L87 Difference]: Start difference. First operand 182 states and 233 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) [2024-11-09 07:50:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:14,527 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2024-11-09 07:50:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:14,527 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 [2024-11-09 07:50:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:14,528 INFO L225 Difference]: With dead ends: 144 [2024-11-09 07:50:14,528 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:50:14,528 INFO L431 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 [2024-11-09 07:50:14,529 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:14,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:50:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 07:50:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 130 states have internal predecessors, (141), 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) [2024-11-09 07:50:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-09 07:50:14,537 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 19 [2024-11-09 07:50:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-09 07:50:14,539 INFO L472 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) [2024-11-09 07:50:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-09 07:50:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:50:14,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:14,540 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:14,544 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 (8)] Ended with exit code 0 [2024-11-09 07:50:14,741 WARN L453 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 [2024-11-09 07:50:14,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1508180184, now seen corresponding path program 1 times [2024-11-09 07:50:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156999915] [2024-11-09 07:50:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:14,742 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 [2024-11-09 07:50:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:14,745 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) [2024-11-09 07:50:14,746 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 [2024-11-09 07:50:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:14,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:50:14,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:14,820 INFO L378 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 [2024-11-09 07:50:14,860 WARN L873 $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 [2024-11-09 07:50:14,883 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:50:14,883 INFO L378 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 [2024-11-09 07:50:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-09 07:50:14,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:15,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156999915] [2024-11-09 07:50:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156999915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:15,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-09 07:50:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970662269] [2024-11-09 07:50:15,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:50:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:50:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:50:15,042 INFO L87 Difference]: Start difference. First operand 140 states and 153 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) [2024-11-09 07:50:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:15,539 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2024-11-09 07:50:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:15,540 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 [2024-11-09 07:50:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:15,541 INFO L225 Difference]: With dead ends: 175 [2024-11-09 07:50:15,541 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 07:50:15,542 INFO L431 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 [2024-11-09 07:50:15,542 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 102 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:15,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 436 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 367 Invalid, 0 Unknown, 189 Unchecked, 0.5s Time] [2024-11-09 07:50:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 07:50:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2024-11-09 07:50:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 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) [2024-11-09 07:50:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2024-11-09 07:50:15,547 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 22 [2024-11-09 07:50:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:15,547 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2024-11-09 07:50:15,548 INFO L472 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) [2024-11-09 07:50:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2024-11-09 07:50:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:50:15,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:15,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:15,553 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 (9)] Ended with exit code 0 [2024-11-09 07:50:15,749 WARN L453 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 [2024-11-09 07:50:15,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:15,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1508180185, now seen corresponding path program 1 times [2024-11-09 07:50:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:15,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488036835] [2024-11-09 07:50:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:15,750 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 [2024-11-09 07:50:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:15,752 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) [2024-11-09 07:50:15,752 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 [2024-11-09 07:50:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:15,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:50:15,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:15,833 INFO L378 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 [2024-11-09 07:50:15,839 INFO L378 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 [2024-11-09 07:50:15,959 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:50:15,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:15,981 INFO L378 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 9 [2024-11-09 07:50:15,990 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:15,991 INFO L378 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 [2024-11-09 07:50:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:50:16,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:16,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488036835] [2024-11-09 07:50:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488036835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1315403460] [2024-11-09 07:50:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:16,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:16,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:16,164 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) [2024-11-09 07:50:16,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 07:50:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:16,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:50:16,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:16,297 INFO L378 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 [2024-11-09 07:50:16,302 INFO L378 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 [2024-11-09 07:50:16,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:16,388 INFO L378 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 9 [2024-11-09 07:50:16,399 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:16,399 INFO L378 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 [2024-11-09 07:50:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:50:16,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1315403460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 07:50:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956077426] [2024-11-09 07:50:16,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:50:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:50:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:50:16,518 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-11-09 07:50:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:17,485 INFO L93 Difference]: Finished difference Result 279 states and 320 transitions. [2024-11-09 07:50:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:50:17,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 [2024-11-09 07:50:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:17,487 INFO L225 Difference]: With dead ends: 279 [2024-11-09 07:50:17,487 INFO L226 Difference]: Without dead ends: 279 [2024-11-09 07:50:17,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-09 07:50:17,487 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 137 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:17,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 873 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 698 Invalid, 0 Unknown, 285 Unchecked, 0.9s Time] [2024-11-09 07:50:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-09 07:50:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2024-11-09 07:50:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 172 states have (on average 1.6744186046511629) internal successors, (288), 215 states have internal predecessors, (288), 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) [2024-11-09 07:50:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 307 transitions. [2024-11-09 07:50:17,494 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 307 transitions. Word has length 22 [2024-11-09 07:50:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:17,494 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 307 transitions. [2024-11-09 07:50:17,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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) [2024-11-09 07:50:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 307 transitions. [2024-11-09 07:50:17,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:50:17,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:17,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:17,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:17,701 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 [2024-11-09 07:50:17,898 WARN L453 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 [2024-11-09 07:50:17,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:17,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash -906909162, now seen corresponding path program 1 times [2024-11-09 07:50:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:17,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162917920] [2024-11-09 07:50:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:17,900 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 [2024-11-09 07:50:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:17,902 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) [2024-11-09 07:50:17,903 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 [2024-11-09 07:50:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:17,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:50:17,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:18,084 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~hdev~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_19|)))) is different from true [2024-11-09 07:50:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:18,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:18,157 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:50:18,157 INFO L378 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 43 treesize of output 38 [2024-11-09 07:50:18,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162917920] [2024-11-09 07:50:18,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162917920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1306395328] [2024-11-09 07:50:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:18,261 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:18,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:18,263 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) [2024-11-09 07:50:18,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-09 07:50:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:18,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:50:18,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:18,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:18,647 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:50:18,648 INFO L378 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 43 treesize of output 38 [2024-11-09 07:50:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1306395328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:18,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-09 07:50:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518980752] [2024-11-09 07:50:18,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:18,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:50:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:50:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-09 07:50:18,755 INFO L87 Difference]: Start difference. First operand 228 states and 307 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) [2024-11-09 07:50:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:19,467 INFO L93 Difference]: Finished difference Result 302 states and 387 transitions. [2024-11-09 07:50:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:50:19,468 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 [2024-11-09 07:50:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:19,470 INFO L225 Difference]: With dead ends: 302 [2024-11-09 07:50:19,470 INFO L226 Difference]: Without dead ends: 297 [2024-11-09 07:50:19,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:50:19,470 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 281 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:19,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 699 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 536 Invalid, 0 Unknown, 230 Unchecked, 0.6s Time] [2024-11-09 07:50:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-09 07:50:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 225. [2024-11-09 07:50:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 169 states have (on average 1.680473372781065) internal successors, (284), 212 states have internal predecessors, (284), 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) [2024-11-09 07:50:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 303 transitions. [2024-11-09 07:50:19,477 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 303 transitions. Word has length 21 [2024-11-09 07:50:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:19,478 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 303 transitions. [2024-11-09 07:50:19,478 INFO L472 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) [2024-11-09 07:50:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 303 transitions. [2024-11-09 07:50:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:50:19,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:19,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:19,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-09 07:50:19,682 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 [2024-11-09 07:50:19,879 WARN L453 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 [2024-11-09 07:50:19,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:19,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash -288771175, now seen corresponding path program 1 times [2024-11-09 07:50:19,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020589266] [2024-11-09 07:50:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:19,881 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 [2024-11-09 07:50:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:19,882 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) [2024-11-09 07:50:19,883 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 [2024-11-09 07:50:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:19,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:19,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:19,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:19,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020589266] [2024-11-09 07:50:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020589266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401576374] [2024-11-09 07:50:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:19,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:50:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:50:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:19,978 INFO L87 Difference]: Start difference. First operand 225 states and 303 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) [2024-11-09 07:50:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:20,011 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2024-11-09 07:50:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:50:20,012 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 [2024-11-09 07:50:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:20,013 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:50:20,013 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:50:20,013 INFO L431 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 [2024-11-09 07:50:20,014 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 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 [2024-11-09 07:50:20,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:50:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:50:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 07:50:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.59375) internal successors, (153), 134 states have internal predecessors, (153), 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) [2024-11-09 07:50:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2024-11-09 07:50:20,018 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 22 [2024-11-09 07:50:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:20,018 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2024-11-09 07:50:20,019 INFO L472 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) [2024-11-09 07:50:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2024-11-09 07:50:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:50:20,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:20,019 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:50:20,023 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 (14)] Ended with exit code 0 [2024-11-09 07:50:20,220 WARN L453 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 [2024-11-09 07:50:20,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2114757105, now seen corresponding path program 1 times [2024-11-09 07:50:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173986226] [2024-11-09 07:50:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:20,221 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 [2024-11-09 07:50:20,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:20,224 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) [2024-11-09 07:50:20,225 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 [2024-11-09 07:50:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:20,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:50:20,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:20,323 INFO L378 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 19 treesize of output 1 [2024-11-09 07:50:20,342 INFO L378 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 [2024-11-09 07:50:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:20,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:20,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173986226] [2024-11-09 07:50:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173986226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:50:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459338616] [2024-11-09 07:50:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:20,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:50:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:50:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:50:20,353 INFO L87 Difference]: Start difference. First operand 143 states and 164 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) [2024-11-09 07:50:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:20,458 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2024-11-09 07:50:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:20,458 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 [2024-11-09 07:50:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:20,459 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:50:20,459 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:50:20,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:20,460 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:20,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 617 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:50:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2024-11-09 07:50:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 100 states have (on average 1.57) internal successors, (157), 137 states have internal predecessors, (157), 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) [2024-11-09 07:50:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2024-11-09 07:50:20,464 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 27 [2024-11-09 07:50:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:20,464 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2024-11-09 07:50:20,464 INFO L472 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) [2024-11-09 07:50:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2024-11-09 07:50:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:50:20,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:20,465 INFO L215 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] [2024-11-09 07:50:20,471 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 (15)] Ended with exit code 0 [2024-11-09 07:50:20,668 WARN L453 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 [2024-11-09 07:50:20,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:20,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 307302642, now seen corresponding path program 1 times [2024-11-09 07:50:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:20,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095453616] [2024-11-09 07:50:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:20,669 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 [2024-11-09 07:50:20,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:20,670 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) [2024-11-09 07:50:20,671 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 [2024-11-09 07:50:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:20,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:20,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:50:21,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:21,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095453616] [2024-11-09 07:50:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095453616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:21,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:50:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458508718] [2024-11-09 07:50:21,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:50:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:21,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:50:21,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:50:21,192 INFO L87 Difference]: Start difference. First operand 147 states and 168 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) [2024-11-09 07:50:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:21,488 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2024-11-09 07:50:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:50:21,488 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 [2024-11-09 07:50:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:21,489 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:50:21,489 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 07:50:21,489 INFO L431 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 [2024-11-09 07:50:21,490 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 108 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:21,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 447 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:50:21,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 07:50:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-09 07:50:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.55) internal successors, (155), 136 states have internal predecessors, (155), 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) [2024-11-09 07:50:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2024-11-09 07:50:21,494 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 27 [2024-11-09 07:50:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:21,494 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2024-11-09 07:50:21,494 INFO L472 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) [2024-11-09 07:50:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2024-11-09 07:50:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:50:21,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:21,495 INFO L215 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] [2024-11-09 07:50:21,500 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 (16)] Ended with exit code 0 [2024-11-09 07:50:21,698 WARN L453 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 [2024-11-09 07:50:21,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1132887579, now seen corresponding path program 1 times [2024-11-09 07:50:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497213234] [2024-11-09 07:50:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:21,699 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 [2024-11-09 07:50:21,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:21,700 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) [2024-11-09 07:50:21,701 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 [2024-11-09 07:50:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:21,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:50:21,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:21,776 INFO L378 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 [2024-11-09 07:50:21,797 INFO L378 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 19 treesize of output 1 [2024-11-09 07:50:21,811 INFO L378 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 [2024-11-09 07:50:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:21,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:21,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497213234] [2024-11-09 07:50:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497213234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:50:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408623243] [2024-11-09 07:50:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:50:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:50:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:50:21,825 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2024-11-09 07:50:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:22,080 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2024-11-09 07:50:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:22,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 28 [2024-11-09 07:50:22,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:22,082 INFO L225 Difference]: With dead ends: 150 [2024-11-09 07:50:22,082 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 07:50:22,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:22,083 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:22,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 456 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:50:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 07:50:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2024-11-09 07:50:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 139 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) [2024-11-09 07:50:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2024-11-09 07:50:22,087 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 28 [2024-11-09 07:50:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2024-11-09 07:50:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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) [2024-11-09 07:50:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2024-11-09 07:50:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:50:22,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:22,088 INFO L215 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] [2024-11-09 07:50:22,092 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 (17)] Ended with exit code 0 [2024-11-09 07:50:22,288 WARN L453 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 [2024-11-09 07:50:22,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1132887580, now seen corresponding path program 1 times [2024-11-09 07:50:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:22,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682008528] [2024-11-09 07:50:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:22,289 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 [2024-11-09 07:50:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:22,290 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) [2024-11-09 07:50:22,291 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 [2024-11-09 07:50:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:22,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:50:22,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:22,375 INFO L378 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 [2024-11-09 07:50:22,410 INFO L378 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 19 treesize of output 1 [2024-11-09 07:50:22,414 INFO L378 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 [2024-11-09 07:50:22,445 INFO L378 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 [2024-11-09 07:50:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:50:22,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:22,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682008528] [2024-11-09 07:50:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682008528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:22,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:50:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623757695] [2024-11-09 07:50:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:22,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:50:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:50:22,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:22,464 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-11-09 07:50:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:22,767 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2024-11-09 07:50:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:50:22,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 28 [2024-11-09 07:50:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:22,768 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:50:22,768 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 07:50:22,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:50:22,769 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:22,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 616 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:50:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 07:50:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-09 07:50:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 139 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) [2024-11-09 07:50:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2024-11-09 07:50:22,773 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 28 [2024-11-09 07:50:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:22,773 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2024-11-09 07:50:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2024-11-09 07:50:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2024-11-09 07:50:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:50:22,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:22,774 INFO L215 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] [2024-11-09 07:50:22,779 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 (18)] Ended with exit code 0 [2024-11-09 07:50:22,977 WARN L453 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 [2024-11-09 07:50:22,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash 936374074, now seen corresponding path program 1 times [2024-11-09 07:50:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:22,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114541769] [2024-11-09 07:50:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:22,979 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 [2024-11-09 07:50:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:22,980 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) [2024-11-09 07:50:22,981 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 [2024-11-09 07:50:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:23,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:50:23,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:23,077 INFO L378 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 [2024-11-09 07:50:23,083 INFO L378 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 [2024-11-09 07:50:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:23,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:23,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114541769] [2024-11-09 07:50:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114541769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:50:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58364359] [2024-11-09 07:50:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:50:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:50:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:50:23,119 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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) [2024-11-09 07:50:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:23,263 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2024-11-09 07:50:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:50:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 28 [2024-11-09 07:50:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:23,264 INFO L225 Difference]: With dead ends: 144 [2024-11-09 07:50:23,264 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 07:50:23,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:50:23,265 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:23,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 627 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 07:50:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 07:50:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.52) internal successors, (152), 134 states have internal predecessors, (152), 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) [2024-11-09 07:50:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-09 07:50:23,269 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 28 [2024-11-09 07:50:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:23,269 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-09 07:50:23,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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) [2024-11-09 07:50:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-09 07:50:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:50:23,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:23,270 INFO L215 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] [2024-11-09 07:50:23,275 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 [2024-11-09 07:50:23,470 WARN L453 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 [2024-11-09 07:50:23,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2078238173, now seen corresponding path program 1 times [2024-11-09 07:50:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653871483] [2024-11-09 07:50:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:23,472 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 [2024-11-09 07:50:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:23,474 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) [2024-11-09 07:50:23,476 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 [2024-11-09 07:50:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:23,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:50:23,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:23,564 INFO L378 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 [2024-11-09 07:50:23,568 INFO L378 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 [2024-11-09 07:50:23,658 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:50:23,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:23,681 INFO L378 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 9 [2024-11-09 07:50:23,700 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:23,701 INFO L378 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 21 treesize of output 20 [2024-11-09 07:50:23,733 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:50:23,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:23,754 INFO L378 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 9 [2024-11-09 07:50:23,765 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:23,765 INFO L378 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 [2024-11-09 07:50:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-09 07:50:23,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:28,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653871483] [2024-11-09 07:50:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653871483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954756999] [2024-11-09 07:50:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:28,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:28,012 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) [2024-11-09 07:50:28,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 07:50:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:28,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:50:28,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:28,176 INFO L378 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 [2024-11-09 07:50:28,181 INFO L378 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 [2024-11-09 07:50:28,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:28,254 INFO L378 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 9 [2024-11-09 07:50:28,272 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:28,272 INFO L378 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 21 treesize of output 20 [2024-11-09 07:50:28,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:50:28,317 INFO L378 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 9 [2024-11-09 07:50:28,325 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:50:28,325 INFO L378 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 [2024-11-09 07:50:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2024-11-09 07:50:28,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1954756999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:28,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-09 07:50:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65850204] [2024-11-09 07:50:28,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:50:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:50:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2024-11-09 07:50:28,542 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2024-11-09 07:50:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:29,103 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2024-11-09 07:50:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:50:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 30 [2024-11-09 07:50:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:29,105 INFO L225 Difference]: With dead ends: 167 [2024-11-09 07:50:29,105 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 07:50:29,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=32, Invalid=105, Unknown=3, NotChecked=42, Total=182 [2024-11-09 07:50:29,106 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:29,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 349 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 346 Unchecked, 0.5s Time] [2024-11-09 07:50:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 07:50:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2024-11-09 07:50:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.51) 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) [2024-11-09 07:50:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2024-11-09 07:50:29,109 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 30 [2024-11-09 07:50:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:29,109 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2024-11-09 07:50:29,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) [2024-11-09 07:50:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2024-11-09 07:50:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:50:29,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:29,110 INFO L215 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] [2024-11-09 07:50:29,114 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 (20)] Ended with exit code 0 [2024-11-09 07:50:29,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:50:29,514 WARN L453 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 [2024-11-09 07:50:29,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:29,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1895723159, now seen corresponding path program 1 times [2024-11-09 07:50:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097266403] [2024-11-09 07:50:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:29,515 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 [2024-11-09 07:50:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:29,516 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) [2024-11-09 07:50:29,518 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 [2024-11-09 07:50:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:29,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:50:29,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:29,588 INFO L378 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 [2024-11-09 07:50:29,648 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:50:29,649 INFO L378 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 21 treesize of output 20 [2024-11-09 07:50:29,730 INFO L378 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 16 treesize of output 13 [2024-11-09 07:50:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:29,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:50:30,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097266403] [2024-11-09 07:50:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097266403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:30,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-11-09 07:50:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388090045] [2024-11-09 07:50:30,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:50:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:30,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:50:30,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:50:30,014 INFO L87 Difference]: Start difference. First operand 143 states and 162 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) [2024-11-09 07:50:30,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:30,469 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-11-09 07:50:30,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:50:30,470 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 [2024-11-09 07:50:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:30,471 INFO L225 Difference]: With dead ends: 170 [2024-11-09 07:50:30,471 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 07:50:30,471 INFO L431 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 [2024-11-09 07:50:30,472 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 182 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:30,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 450 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:50:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 07:50:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2024-11-09 07:50:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 136 states have internal predecessors, (154), 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) [2024-11-09 07:50:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2024-11-09 07:50:30,475 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 31 [2024-11-09 07:50:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:30,476 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2024-11-09 07:50:30,476 INFO L472 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) [2024-11-09 07:50:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2024-11-09 07:50:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:50:30,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:30,476 INFO L215 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] [2024-11-09 07:50:30,481 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 [2024-11-09 07:50:30,677 WARN L453 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 [2024-11-09 07:50:30,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:30,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 27091421, now seen corresponding path program 1 times [2024-11-09 07:50:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482765493] [2024-11-09 07:50:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:30,679 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 [2024-11-09 07:50:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:30,681 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) [2024-11-09 07:50:30,682 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 [2024-11-09 07:50:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:30,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:50:30,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:50:30,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:50:30,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482765493] [2024-11-09 07:50:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482765493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:50:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:50:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:50:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673238608] [2024-11-09 07:50:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:50:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:50:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:50:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:50:30,775 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-11-09 07:50:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:30,921 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2024-11-09 07:50:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:50:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 32 [2024-11-09 07:50:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:30,922 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:50:30,922 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:50:30,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:50:30,922 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:30,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 200 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:50:30,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:50:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2024-11-09 07:50:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 135 states have internal predecessors, (153), 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) [2024-11-09 07:50:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2024-11-09 07:50:30,926 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 32 [2024-11-09 07:50:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2024-11-09 07:50:30,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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) [2024-11-09 07:50:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2024-11-09 07:50:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:50:30,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:30,928 INFO L215 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] [2024-11-09 07:50:30,932 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 [2024-11-09 07:50:31,128 WARN L453 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 [2024-11-09 07:50:31,129 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 27091422, now seen corresponding path program 1 times [2024-11-09 07:50:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207206589] [2024-11-09 07:50:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:31,130 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 [2024-11-09 07:50:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:31,133 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) [2024-11-09 07:50:31,134 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 [2024-11-09 07:50:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:31,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:50:31,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:31,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:31,400 INFO L378 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 8 treesize of output 6 [2024-11-09 07:50:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:31,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207206589] [2024-11-09 07:50:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207206589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:50:31,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:50:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-09 07:50:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616445288] [2024-11-09 07:50:31,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:50:31,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:50:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:50:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:50:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:50:31,566 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 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) [2024-11-09 07:50:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:31,937 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2024-11-09 07:50:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:50:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 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 32 [2024-11-09 07:50:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:31,938 INFO L225 Difference]: With dead ends: 144 [2024-11-09 07:50:31,938 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 07:50:31,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:50:31,938 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 214 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:31,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 589 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:50:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 07:50:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 07:50:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 134 states have internal predecessors, (152), 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) [2024-11-09 07:50:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2024-11-09 07:50:31,943 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 32 [2024-11-09 07:50:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:31,943 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2024-11-09 07:50:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 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) [2024-11-09 07:50:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2024-11-09 07:50:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:50:31,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:31,944 INFO L215 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] [2024-11-09 07:50:31,948 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 (24)] Ended with exit code 0 [2024-11-09 07:50:32,144 WARN L453 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 [2024-11-09 07:50:32,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:50:32,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash 723829370, now seen corresponding path program 1 times [2024-11-09 07:50:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347357584] [2024-11-09 07:50:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:32,146 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 [2024-11-09 07:50:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:32,147 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) [2024-11-09 07:50:32,148 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 [2024-11-09 07:50:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:32,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:50:32,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:37,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:37,458 INFO L349 Elim1Store]: treesize reduction 86, result has 8.5 percent of original size [2024-11-09 07:50:37,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 168 treesize of output 154 [2024-11-09 07:50:45,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347357584] [2024-11-09 07:50:45,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347357584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [599957584] [2024-11-09 07:50:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:45,784 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:45,785 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:45,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-09 07:50:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:45,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:50:45,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:58,774 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv0 32))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_39|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29| (_ bv1 1)) |v_ULTIMATE.start_entry_point_~intf~2#1.base_39| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~hdev~0#1.base_29|) (_ bv0 1))))) is different from true [2024-11-09 07:50:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:58,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:51:07,073 INFO L378 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 [2024-11-09 07:51:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [599957584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:51:17,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:51:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2024-11-09 07:51:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646461764] [2024-11-09 07:51:17,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:51:17,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:51:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:51:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=636, Unknown=11, NotChecked=52, Total=812 [2024-11-09 07:51:17,469 INFO L87 Difference]: Start difference. First operand 144 states and 163 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) [2024-11-09 07:51:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:23,381 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2024-11-09 07:51:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:51:23,381 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 [2024-11-09 07:51:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:23,382 INFO L225 Difference]: With dead ends: 146 [2024-11-09 07:51:23,382 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 07:51:23,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=179, Invalid=1145, Unknown=12, NotChecked=70, Total=1406 [2024-11-09 07:51:23,383 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 19 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:23,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 879 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 879 Invalid, 14 Unknown, 138 Unchecked, 1.6s Time] [2024-11-09 07:51:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 07:51:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-11-09 07:51:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 122 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) [2024-11-09 07:51:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2024-11-09 07:51:23,387 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 33 [2024-11-09 07:51:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:23,387 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2024-11-09 07:51:23,387 INFO L472 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) [2024-11-09 07:51:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2024-11-09 07:51:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:51:23,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:23,388 INFO L215 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] [2024-11-09 07:51:23,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2024-11-09 07:51:23,591 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 [2024-11-09 07:51:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 [2024-11-09 07:51:23,789 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:51:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 265052702, now seen corresponding path program 1 times [2024-11-09 07:51:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759510550] [2024-11-09 07:51:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:23,790 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 [2024-11-09 07:51:23,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:23,791 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) [2024-11-09 07:51:23,792 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 [2024-11-09 07:51:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:23,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:51:23,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:23,997 INFO L378 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 15 treesize of output 1 [2024-11-09 07:51:24,036 INFO L378 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 [2024-11-09 07:51:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:51:24,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:51:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:51:24,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:24,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759510550] [2024-11-09 07:51:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759510550] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:51:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:51:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-11-09 07:51:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094441691] [2024-11-09 07:51:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:51:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:51:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:51:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:51:24,148 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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) [2024-11-09 07:51:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:24,650 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2024-11-09 07:51:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:51:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 34 [2024-11-09 07:51:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:24,651 INFO L225 Difference]: With dead ends: 184 [2024-11-09 07:51:24,652 INFO L226 Difference]: Without dead ends: 184 [2024-11-09 07:51:24,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:51:24,652 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 182 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:24,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 409 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:51:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-09 07:51:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 129. [2024-11-09 07:51:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 121 states have internal predecessors, (137), 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) [2024-11-09 07:51:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2024-11-09 07:51:24,656 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 34 [2024-11-09 07:51:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:24,660 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2024-11-09 07:51:24,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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) [2024-11-09 07:51:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2024-11-09 07:51:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:51:24,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:24,661 INFO L215 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] [2024-11-09 07:51:24,667 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 [2024-11-09 07:51:24,863 WARN L453 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 [2024-11-09 07:51:24,863 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:51:24,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash 265052703, now seen corresponding path program 1 times [2024-11-09 07:51:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:24,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376467326] [2024-11-09 07:51:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:24,864 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 [2024-11-09 07:51:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:24,865 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2024-11-09 07:51:24,866 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 (28)] Waiting until timeout for monitored process [2024-11-09 07:51:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:24,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:51:24,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:25,105 INFO L378 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 15 treesize of output 1 [2024-11-09 07:51:25,110 INFO L378 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 11 treesize of output 7 [2024-11-09 07:51:25,160 INFO L378 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 [2024-11-09 07:51:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:51:25,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:51:25,494 INFO L378 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 8 treesize of output 6 [2024-11-09 07:51:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:51:25,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:25,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376467326] [2024-11-09 07:51:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376467326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:51:25,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:51:25,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-11-09 07:51:25,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157101663] [2024-11-09 07:51:25,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:51:25,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:51:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:51:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:51:25,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:51:25,727 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 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) [2024-11-09 07:51:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:51:26,825 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2024-11-09 07:51:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:51:26,826 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 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 34 [2024-11-09 07:51:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:51:26,827 INFO L225 Difference]: With dead ends: 174 [2024-11-09 07:51:26,827 INFO L226 Difference]: Without dead ends: 174 [2024-11-09 07:51:26,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:51:26,828 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 392 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:51:26,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 925 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:51:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-09 07:51:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2024-11-09 07:51:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.511111111111111) internal successors, (136), 120 states have internal predecessors, (136), 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) [2024-11-09 07:51:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-09 07:51:26,837 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 34 [2024-11-09 07:51:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:51:26,838 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-09 07:51:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 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) [2024-11-09 07:51:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-09 07:51:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:51:26,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:51:26,839 INFO L215 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, 1] [2024-11-09 07:51:26,845 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 (28)] Ended with exit code 0 [2024-11-09 07:51:27,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 [2024-11-09 07:51:27,041 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_hid_set_drvdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_hid_set_drvdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2024-11-09 07:51:27,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:51:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -373300797, now seen corresponding path program 1 times [2024-11-09 07:51:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:51:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224055786] [2024-11-09 07:51:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:27,042 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 [2024-11-09 07:51:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:51:27,045 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) [2024-11-09 07:51:27,046 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 [2024-11-09 07:51:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:27,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 07:51:27,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:27,180 INFO L378 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 [2024-11-09 07:51:27,269 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:51:27,269 INFO L378 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 [2024-11-09 07:51:27,401 INFO L378 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 [2024-11-09 07:51:27,452 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 07:51:27,452 INFO L378 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 [2024-11-09 07:51:27,511 INFO L378 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 15 treesize of output 1 [2024-11-09 07:51:27,529 INFO L378 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 11 treesize of output 7 [2024-11-09 07:51:27,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:51:27,798 INFO L378 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 58 treesize of output 51 [2024-11-09 07:51:27,808 INFO L378 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 24 treesize of output 11 [2024-11-09 07:51:27,846 INFO L378 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 23 treesize of output 22 [2024-11-09 07:51:27,856 INFO L378 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 57 treesize of output 29 [2024-11-09 07:51:28,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:28,201 INFO L378 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 72 treesize of output 31 [2024-11-09 07:51:28,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:51:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:51:28,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:51:29,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (and (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_371))) (store .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse0 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)) (select |c_#length| (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_370))) (store .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse4 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 |c_ULTIMATE.start_entry_point_~intf~2#1.base|))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3)))) (forall ((v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem63#1.base| v_ArrVal_371))) (store .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base| (store (select .cse6 |c_ULTIMATE.start_entry_point_~hdev~0#1.base|) .cse1 .cse2))) |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse3))) (bvule (bvadd (_ bv7 32) .cse5) (bvadd (_ bv8 32) .cse5)))))) is different from false [2024-11-09 07:51:29,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|))) (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_entry_point_~intf~2#1.offset|)) (.cse2 (bvadd |c_ULTIMATE.start_entry_point_~hdev~0#1.offset| (_ bv8 32))) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~intf~2#1.base|) .cse5))) (and (forall ((v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_371))) (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 (_ bv7 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_371 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_371))) (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)) (select |c_#length| (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_370))) (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 [2024-11-09 07:51:29,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:29,298 INFO L378 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 [2024-11-09 07:51:29,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:29,309 INFO L378 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 [2024-11-09 07:51:29,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:29,327 INFO L378 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 580 treesize of output 576 [2024-11-09 07:51:29,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:29,373 INFO L378 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 2048 treesize of output 1990 [2024-11-09 07:51:29,399 INFO L378 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 292 treesize of output 276 [2024-11-09 07:51:29,410 INFO L378 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 332 treesize of output 308 [2024-11-09 07:51:29,597 INFO L378 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 219 treesize of output 203 [2024-11-09 07:51:35,943 INFO L378 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 217 treesize of output 201 [2024-11-09 07:51:36,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:36,091 INFO L378 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 95 treesize of output 66 [2024-11-09 07:51:36,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:51:36,139 INFO L378 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 404 treesize of output 390 [2024-11-09 07:51:36,151 INFO L378 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 260 treesize of output 228 [2024-11-09 07:51:36,527 INFO L378 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 88 treesize of output 68 [2024-11-09 07:51:37,047 INFO L378 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 73 treesize of output 71 [2024-11-09 07:51:37,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:51:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224055786] [2024-11-09 07:51:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224055786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:51:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1388585099] [2024-11-09 07:51:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:51:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:51:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:51:37,362 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) [2024-11-09 07:51:37,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-09 07:51:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:51:37,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 07:51:37,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:51:37,562 INFO L378 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 [2024-11-09 07:51:37,615 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:51:37,616 INFO L378 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 [2024-11-09 07:51:37,657 INFO L378 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 [2024-11-09 07:51:37,708 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 07:51:37,708 INFO L378 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 [2024-11-09 07:51:37,758 INFO L378 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 11 treesize of output 7 [2024-11-09 07:51:37,776 INFO L378 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 15 treesize of output 1