./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:23:04,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:23:04,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:23:04,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:23:04,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:23:04,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:23:04,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:23:04,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:23:04,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:23:04,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:23:04,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:23:04,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:23:04,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:23:04,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:23:04,316 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:23:04,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:23:04,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:23:04,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:23:04,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:23:04,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:23:04,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:23:04,318 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:23:04,319 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:23:04,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:23:04,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:23:04,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:23:04,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:23:04,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:23:04,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:23:04,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:23:04,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:23:04,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:23:04,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:23:04,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:04,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:23:04,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:23:04,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:23:04,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:23:04,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:23:04,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:23:04,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:23:04,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:23:04,325 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 -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2024-10-24 16:23:04,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:23:04,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:23:04,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:23:04,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:23:04,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:23:04,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2024-10-24 16:23:05,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:23:06,225 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:23:06,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2024-10-24 16:23:06,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73fab3f6/0ecd19db438a47a7a91129b39cf87eca/FLAG69fcabe5e [2024-10-24 16:23:06,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73fab3f6/0ecd19db438a47a7a91129b39cf87eca [2024-10-24 16:23:06,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:23:06,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:23:06,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:06,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:23:06,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:23:06,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:06" (1/1) ... [2024-10-24 16:23:06,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6b29ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:06, skipping insertion in model container [2024-10-24 16:23:06,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:06" (1/1) ... [2024-10-24 16:23:06,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:06,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:06,769 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-10-24 16:23:06,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@33b110f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:06, skipping insertion in model container [2024-10-24 16:23:06,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:06,770 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:23:06,772 INFO L158 Benchmark]: Toolchain (without parser) took 507.36ms. Allocated memory is still 192.9MB. Free memory was 164.5MB in the beginning and 147.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:23:06,772 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:23:06,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.45ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 147.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:23:06,774 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.20ms. Allocated memory is still 130.0MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.45ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 147.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:23:08,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:23:08,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:23:08,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:23:08,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:23:08,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:23:08,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:23:08,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:23:08,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:23:08,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:23:08,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:23:08,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:23:08,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:23:08,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:23:08,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:23:08,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:23:08,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:23:08,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:23:08,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:23:08,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:23:08,891 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:23:08,891 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:23:08,892 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:23:08,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:23:08,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:23:08,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:23:08,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:23:08,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:23:08,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:23:08,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:23:08,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:23:08,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:23:08,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:23:08,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:23:08,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:23:08,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:08,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:23:08,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:23:08,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:23:08,899 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:08,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:23:08,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:23:08,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:23:08,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:23:08,901 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:23:08,901 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 -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2024-10-24 16:23:09,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:23:09,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:23:09,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:23:09,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:23:09,273 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:23:09,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2024-10-24 16:23:10,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:23:11,047 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:23:11,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2024-10-24 16:23:11,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5190860df/4d9de47feb234c58bc03a360f7d86296/FLAGc78681009 [2024-10-24 16:23:11,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5190860df/4d9de47feb234c58bc03a360f7d86296 [2024-10-24 16:23:11,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:23:11,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:23:11,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:11,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:23:11,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:23:11,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38107df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11, skipping insertion in model container [2024-10-24 16:23:11,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:11,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:11,601 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:23:11,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:23:11,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:11,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:23:11,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:23:11,776 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:23:11,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11 WrapperNode [2024-10-24 16:23:11,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:23:11,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:23:11,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:23:11,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:23:11,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,833 INFO L138 Inliner]: procedures = 166, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 69 [2024-10-24 16:23:11,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:23:11,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:23:11,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:23:11,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:23:11,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,873 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-24 16:23:11,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:23:11,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:23:11,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:23:11,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:23:11,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (1/1) ... [2024-10-24 16:23:11,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:23:11,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:23:11,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:23:11,946 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-10-24 16:23:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:23:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:23:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:23:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:23:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:23:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:23:12,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:23:12,137 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:23:12,430 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-24 16:23:12,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:23:12,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:23:12,468 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 16:23:12,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:12 BoogieIcfgContainer [2024-10-24 16:23:12,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:23:12,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:23:12,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:23:12,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:23:12,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:23:11" (1/3) ... [2024-10-24 16:23:12,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67900472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:12, skipping insertion in model container [2024-10-24 16:23:12,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:23:11" (2/3) ... [2024-10-24 16:23:12,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67900472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:23:12, skipping insertion in model container [2024-10-24 16:23:12,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:23:12" (3/3) ... [2024-10-24 16:23:12,477 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2024-10-24 16:23:12,493 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:23:12,494 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-24 16:23:12,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:23:12,549 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;@5f8c2197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:23:12,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-24 16:23:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:23:12,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:12,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:12,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -901967375, now seen corresponding path program 1 times [2024-10-24 16:23:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876718260] [2024-10-24 16:23:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:12,579 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-10-24 16:23:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:12,582 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-10-24 16:23:12,583 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-10-24 16:23:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:12,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:12,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:12,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:12,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876718260] [2024-10-24 16:23:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876718260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635091288] [2024-10-24 16:23:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:12,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:12,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:12,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:12,798 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 42 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:12,927 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2024-10-24 16:23:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:12,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-24 16:23:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:12,938 INFO L225 Difference]: With dead ends: 80 [2024-10-24 16:23:12,939 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 16:23:12,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-24 16:23:12,945 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 33 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:12,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 16:23:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2024-10-24 16:23:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-10-24 16:23:12,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 10 [2024-10-24 16:23:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-24 16:23:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-10-24 16:23:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:23:12,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:12,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:12,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:13,191 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-10-24 16:23:13,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -902045630, now seen corresponding path program 1 times [2024-10-24 16:23:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822650530] [2024-10-24 16:23:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:13,194 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-10-24 16:23:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:13,198 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-10-24 16:23:13,199 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-10-24 16:23:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:13,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:23:13,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:13,331 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-10-24 16:23:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:13,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:13,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822650530] [2024-10-24 16:23:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822650530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716080031] [2024-10-24 16:23:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:13,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:13,420 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:13,569 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-10-24 16:23:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:13,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-24 16:23:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:13,572 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:23:13,572 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:23:13,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-24 16:23:13,573 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:13,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 114 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:23:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-24 16:23:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.641025641025641) internal successors, (64), 53 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-24 16:23:13,584 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2024-10-24 16:23:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:13,585 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-24 16:23:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-24 16:23:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:23:13,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:13,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:13,593 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-10-24 16:23:13,787 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-10-24 16:23:13,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash -902045629, now seen corresponding path program 1 times [2024-10-24 16:23:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584899334] [2024-10-24 16:23:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:13,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-10-24 16:23:13,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:13,794 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-10-24 16:23:13,796 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-10-24 16:23:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:13,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:23:13,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:13,890 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-10-24 16:23:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:14,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:14,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584899334] [2024-10-24 16:23:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584899334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:14,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:14,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 16:23:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267574424] [2024-10-24 16:23:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:14,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:23:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:23:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:23:14,029 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-10-24 16:23:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:14,337 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-10-24 16:23:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:23:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 10 [2024-10-24 16:23:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:14,339 INFO L225 Difference]: With dead ends: 69 [2024-10-24 16:23:14,340 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 16:23:14,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:23:14,341 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:14,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 246 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:23:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 16:23:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-10-24 16:23:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 62 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-10-24 16:23:14,355 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 10 [2024-10-24 16:23:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-10-24 16:23:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-10-24 16:23:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-10-24 16:23:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:23:14,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:14,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:14,360 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-10-24 16:23:14,557 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-10-24 16:23:14,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:14,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash -14463694, now seen corresponding path program 1 times [2024-10-24 16:23:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355937660] [2024-10-24 16:23:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:14,559 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-10-24 16:23:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:14,562 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-10-24 16:23:14,564 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-10-24 16:23:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:14,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:14,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:14,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:14,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:14,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355937660] [2024-10-24 16:23:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355937660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:14,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:23:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410282250] [2024-10-24 16:23:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:23:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:23:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:14,630 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 16:23:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:14,734 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2024-10-24 16:23:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:23:14,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-24 16:23:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:14,736 INFO L225 Difference]: With dead ends: 98 [2024-10-24 16:23:14,736 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 16:23:14,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-24 16:23:14,737 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 33 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 133 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 16:23:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 67. [2024-10-24 16:23:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5625) internal successors, (75), 62 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:23:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-10-24 16:23:14,745 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2024-10-24 16:23:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:14,745 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-10-24 16:23:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 16:23:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-10-24 16:23:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:23:14,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:14,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:14,749 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 (5)] Ended with exit code 0 [2024-10-24 16:23:14,946 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-10-24 16:23:14,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:14,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash -14541949, now seen corresponding path program 1 times [2024-10-24 16:23:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486194737] [2024-10-24 16:23:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:14,948 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-10-24 16:23:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:14,952 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-10-24 16:23:14,953 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-10-24 16:23:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:14,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:23:14,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:15,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:15,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:15,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486194737] [2024-10-24 16:23:15,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486194737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:15,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:15,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:15,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124080453] [2024-10-24 16:23:15,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:15,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:15,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:15,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:15,068 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:15,134 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-24 16:23:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:15,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-24 16:23:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:15,135 INFO L225 Difference]: With dead ends: 56 [2024-10-24 16:23:15,135 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 16:23:15,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-24 16:23:15,136 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:15,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 16:23:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-24 16:23:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-10-24 16:23:15,142 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 10 [2024-10-24 16:23:15,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:15,142 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-10-24 16:23:15,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-10-24 16:23:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-10-24 16:23:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 16:23:15,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:15,143 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:15,146 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-10-24 16:23:15,343 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-10-24 16:23:15,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 717621878, now seen corresponding path program 1 times [2024-10-24 16:23:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664509327] [2024-10-24 16:23:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:15,345 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-10-24 16:23:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:15,346 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-10-24 16:23:15,347 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-10-24 16:23:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:15,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:23:15,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:15,421 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-10-24 16:23:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:15,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:16,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664509327] [2024-10-24 16:23:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664509327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:16,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:16,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 16:23:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607707101] [2024-10-24 16:23:16,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:16,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:16,144 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-10-24 16:23:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:17,011 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-10-24 16:23:17,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:23:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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 12 [2024-10-24 16:23:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:17,013 INFO L225 Difference]: With dead ends: 63 [2024-10-24 16:23:17,013 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 16:23:17,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:23:17,015 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 51 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:17,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 317 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:23:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 16:23:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-10-24 16:23:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-24 16:23:17,023 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 12 [2024-10-24 16:23:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:17,027 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-24 16:23:17,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 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-10-24 16:23:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-24 16:23:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:23:17,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:17,028 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:17,031 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-10-24 16:23:17,228 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-10-24 16:23:17,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1874672497, now seen corresponding path program 2 times [2024-10-24 16:23:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:17,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209254416] [2024-10-24 16:23:17,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:17,230 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-10-24 16:23:17,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:17,231 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-10-24 16:23:17,232 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-10-24 16:23:17,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:23:17,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:17,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:23:17,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:17,341 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-10-24 16:23:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:17,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:18,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209254416] [2024-10-24 16:23:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209254416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-24 16:23:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008112735] [2024-10-24 16:23:18,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:18,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:23:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:23:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:23:18,713 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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-10-24 16:23:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:20,414 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2024-10-24 16:23:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:23:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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 18 [2024-10-24 16:23:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:20,416 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:23:20,416 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:23:20,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 16:23:20,417 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 70 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:20,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 387 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:23:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:23:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-10-24 16:23:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.462962962962963) internal successors, (79), 68 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2024-10-24 16:23:20,423 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 18 [2024-10-24 16:23:20,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2024-10-24 16:23:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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-10-24 16:23:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2024-10-24 16:23:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:23:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:20,426 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:20,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:20,626 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-10-24 16:23:20,627 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 123452153, now seen corresponding path program 1 times [2024-10-24 16:23:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981834381] [2024-10-24 16:23:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:20,628 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-10-24 16:23:20,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:20,631 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-10-24 16:23:20,635 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-10-24 16:23:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:20,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:23:20,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:20,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:20,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981834381] [2024-10-24 16:23:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981834381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:20,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-24 16:23:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926475138] [2024-10-24 16:23:20,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:20,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:20,968 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:21,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:21,178 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-10-24 16:23:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:23:21,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-24 16:23:21,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:21,179 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:23:21,179 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:23:21,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:23:21,180 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:21,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 298 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:23:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:23:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-10-24 16:23:21,190 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2024-10-24 16:23:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:21,190 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-10-24 16:23:21,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-10-24 16:23:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:23:21,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:21,191 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:21,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:21,392 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-10-24 16:23:21,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash -481745791, now seen corresponding path program 3 times [2024-10-24 16:23:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135940771] [2024-10-24 16:23:21,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:23:21,393 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-10-24 16:23:21,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:21,395 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-10-24 16:23:21,396 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-10-24 16:23:21,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-24 16:23:21,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:21,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:23:21,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:21,571 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-10-24 16:23:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:22,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:23,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135940771] [2024-10-24 16:23:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135940771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:23,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2024-10-24 16:23:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495665748] [2024-10-24 16:23:23,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 16:23:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 16:23:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 16:23:24,001 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 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-10-24 16:23:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:25,447 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-10-24 16:23:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 16:23:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 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 30 [2024-10-24 16:23:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:25,449 INFO L225 Difference]: With dead ends: 70 [2024-10-24 16:23:25,449 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:23:25,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 16:23:25,450 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:25,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 558 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 16:23:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:23:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 16:23:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-10-24 16:23:25,456 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 30 [2024-10-24 16:23:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:25,457 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-10-24 16:23:25,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.696969696969697) internal successors, (56), 32 states have internal predecessors, (56), 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-10-24 16:23:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-10-24 16:23:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:23:25,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:25,458 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:25,463 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-10-24 16:23:25,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 16:23:25,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:25,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1351335526, now seen corresponding path program 2 times [2024-10-24 16:23:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086322811] [2024-10-24 16:23:25,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:25,660 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-10-24 16:23:25,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:25,663 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10-24 16:23:25,664 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 (11)] Waiting until timeout for monitored process [2024-10-24 16:23:25,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:23:25,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:25,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:23:25,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:25,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:25,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086322811] [2024-10-24 16:23:25,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086322811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:25,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:25,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535752493] [2024-10-24 16:23:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:25,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:23:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:25,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:23:25,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:25,765 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-24 16:23:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:25,803 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-24 16:23:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:23:25,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 35 [2024-10-24 16:23:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:25,805 INFO L225 Difference]: With dead ends: 70 [2024-10-24 16:23:25,805 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:23:25,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-10-24 16:23:25,806 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:23:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2024-10-24 16:23:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:23:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-10-24 16:23:25,813 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 35 [2024-10-24 16:23:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:25,813 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-10-24 16:23:25,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-24 16:23:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-10-24 16:23:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:23:25,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:25,814 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:25,819 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 (11)] Ended with exit code 0 [2024-10-24 16:23:26,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10-24 16:23:26,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:26,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1086077697, now seen corresponding path program 1 times [2024-10-24 16:23:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422243484] [2024-10-24 16:23:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:26,016 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-10-24 16:23:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:26,017 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-10-24 16:23:26,018 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-10-24 16:23:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:26,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 16:23:26,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:26,193 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-10-24 16:23:26,198 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-10-24 16:23:26,433 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-10-24 16:23:26,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:26,457 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-10-24 16:23:26,470 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:26,470 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-10-24 16:23:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-24 16:23:26,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:26,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422243484] [2024-10-24 16:23:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422243484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587298558] [2024-10-24 16:23:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:26,688 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-10-24 16:23:26,690 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-10-24 16:23:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:26,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 16:23:26,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:26,985 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-10-24 16:23:26,989 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-10-24 16:23:27,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:27,227 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-10-24 16:23:27,239 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:27,240 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-10-24 16:23:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-24 16:23:27,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:27,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [587298558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:27,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-10-24 16:23:27,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747392357] [2024-10-24 16:23:27,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:23:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:23:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=1, NotChecked=20, Total=156 [2024-10-24 16:23:27,438 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-10-24 16:23:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:27,825 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-10-24 16:23:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:23:27,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 39 [2024-10-24 16:23:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:27,827 INFO L225 Difference]: With dead ends: 93 [2024-10-24 16:23:27,827 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 16:23:27,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2024-10-24 16:23:27,827 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 38 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:27,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 280 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2024-10-24 16:23:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 16:23:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2024-10-24 16:23:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.380952380952381) internal successors, (87), 75 states have internal predecessors, (87), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-10-24 16:23:27,832 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 39 [2024-10-24 16:23:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:27,833 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-10-24 16:23:27,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-10-24 16:23:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-10-24 16:23:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:23:27,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:27,834 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:27,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-10-24 16:23:28,039 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-10-24 16:23:28,234 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-10-24 16:23:28,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:28,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1086077698, now seen corresponding path program 1 times [2024-10-24 16:23:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:28,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134719563] [2024-10-24 16:23:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:28,236 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-10-24 16:23:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:28,240 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-10-24 16:23:28,241 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-10-24 16:23:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:28,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:23:28,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:28,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 7 [2024-10-24 16:23:28,444 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-10-24 16:23:28,462 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:23:28,463 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-10-24 16:23:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2024-10-24 16:23:28,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:28,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134719563] [2024-10-24 16:23:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134719563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:28,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2024-10-24 16:23:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415563777] [2024-10-24 16:23:28,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:28,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:23:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:23:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-10-24 16:23:28,615 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-10-24 16:23:28,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:28,794 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2024-10-24 16:23:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:23:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 39 [2024-10-24 16:23:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:28,795 INFO L225 Difference]: With dead ends: 95 [2024-10-24 16:23:28,796 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 16:23:28,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-10-24 16:23:28,796 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:28,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 139 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2024-10-24 16:23:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 16:23:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-10-24 16:23:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 79 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2024-10-24 16:23:28,802 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 39 [2024-10-24 16:23:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:28,802 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2024-10-24 16:23:28,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-10-24 16:23:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2024-10-24 16:23:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:23:28,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:28,803 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:28,811 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-10-24 16:23:29,004 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-10-24 16:23:29,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:29,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash 691386062, now seen corresponding path program 1 times [2024-10-24 16:23:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948812342] [2024-10-24 16:23:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:29,005 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-10-24 16:23:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:29,006 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-10-24 16:23:29,007 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-10-24 16:23:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:29,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:23:29,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:29,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:29,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948812342] [2024-10-24 16:23:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948812342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:29,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892994675] [2024-10-24 16:23:29,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:29,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:29,142 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-24 16:23:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:29,181 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2024-10-24 16:23:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:29,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 40 [2024-10-24 16:23:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:29,183 INFO L225 Difference]: With dead ends: 90 [2024-10-24 16:23:29,183 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 16:23:29,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-10-24 16:23:29,184 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:29,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 16:23:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-24 16:23:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 80 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-10-24 16:23:29,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 40 [2024-10-24 16:23:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:29,191 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-10-24 16:23:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-24 16:23:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-10-24 16:23:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:23:29,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:29,194 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:29,200 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-10-24 16:23:29,394 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-10-24 16:23:29,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1578889743, now seen corresponding path program 1 times [2024-10-24 16:23:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769302867] [2024-10-24 16:23:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:29,396 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-10-24 16:23:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:29,399 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-10-24 16:23:29,400 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-10-24 16:23:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:29,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:23:29,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 16:23:29,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:29,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769302867] [2024-10-24 16:23:29,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769302867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:29,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:29,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:23:29,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975785969] [2024-10-24 16:23:29,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:29,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:23:29,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:29,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:23:29,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:23:29,540 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:29,579 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-10-24 16:23:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:23:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-10-24 16:23:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:29,581 INFO L225 Difference]: With dead ends: 89 [2024-10-24 16:23:29,581 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 16:23:29,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-10-24 16:23:29,582 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:29,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 16:23:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-24 16:23:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 81 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-24 16:23:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2024-10-24 16:23:29,586 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 40 [2024-10-24 16:23:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:29,587 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2024-10-24 16:23:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:23:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2024-10-24 16:23:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 16:23:29,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:29,588 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:29,594 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-10-24 16:23:29,788 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-10-24 16:23:29,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1091416908, now seen corresponding path program 1 times [2024-10-24 16:23:29,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:29,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140970674] [2024-10-24 16:23:29,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:29,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-10-24 16:23:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:29,793 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-10-24 16:23:29,794 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-10-24 16:23:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:29,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:23:29,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 16:23:30,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 16:23:30,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140970674] [2024-10-24 16:23:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140970674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:30,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:23:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785884055] [2024-10-24 16:23:30,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:30,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:23:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:23:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:23:30,069 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:30,172 INFO L93 Difference]: Finished difference Result 115 states and 147 transitions. [2024-10-24 16:23:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:23:30,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2024-10-24 16:23:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:30,173 INFO L225 Difference]: With dead ends: 115 [2024-10-24 16:23:30,173 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:23:30,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:23:30,174 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:30,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 210 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:23:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:23:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 101 states have internal predecessors, (124), 8 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2024-10-24 16:23:30,179 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 43 [2024-10-24 16:23:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2024-10-24 16:23:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:23:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2024-10-24 16:23:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 16:23:30,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:30,180 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:30,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:30,380 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-10-24 16:23:30,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1778808779, now seen corresponding path program 1 times [2024-10-24 16:23:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817429413] [2024-10-24 16:23:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:30,382 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-10-24 16:23:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:30,385 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-10-24 16:23:30,386 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-10-24 16:23:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:30,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:23:30,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:30,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:30,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817429413] [2024-10-24 16:23:30,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817429413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:30,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:30,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-24 16:23:30,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501526925] [2024-10-24 16:23:30,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:30,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:23:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:23:30,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:23:30,856 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-10-24 16:23:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:30,949 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2024-10-24 16:23:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:23:30,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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 43 [2024-10-24 16:23:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:30,950 INFO L225 Difference]: With dead ends: 118 [2024-10-24 16:23:30,950 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 16:23:30,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:23:30,951 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:30,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 102 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:23:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 16:23:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 16:23:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 101 states have internal predecessors, (124), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2024-10-24 16:23:30,955 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 43 [2024-10-24 16:23:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2024-10-24 16:23:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-10-24 16:23:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2024-10-24 16:23:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:23:30,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:30,957 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:30,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:31,157 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-10-24 16:23:31,158 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:31,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:31,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1185717850, now seen corresponding path program 1 times [2024-10-24 16:23:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:31,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280581511] [2024-10-24 16:23:31,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:31,159 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-10-24 16:23:31,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:31,160 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-10-24 16:23:31,162 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-10-24 16:23:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:31,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:23:31,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:31,468 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_26| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_26|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_26| (_ bv0 1))))) is different from true [2024-10-24 16:23:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:31,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:31,545 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-24 16:23:31,545 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-10-24 16:23:31,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280581511] [2024-10-24 16:23:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280581511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [774394140] [2024-10-24 16:23:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:31,830 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-24 16:23:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:32,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:23:32,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:32,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:32,421 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-24 16:23:32,421 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-10-24 16:23:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [774394140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:32,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-10-24 16:23:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222394323] [2024-10-24 16:23:32,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:23:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:32,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:23:32,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:23:32,577 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-10-24 16:23:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:32,716 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2024-10-24 16:23:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:23:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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 46 [2024-10-24 16:23:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:32,717 INFO L225 Difference]: With dead ends: 129 [2024-10-24 16:23:32,717 INFO L226 Difference]: Without dead ends: 120 [2024-10-24 16:23:32,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:23:32,718 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:32,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2024-10-24 16:23:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-24 16:23:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2024-10-24 16:23:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.264367816091954) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 133 transitions. [2024-10-24 16:23:32,723 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 133 transitions. Word has length 46 [2024-10-24 16:23:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:32,723 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 133 transitions. [2024-10-24 16:23:32,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-10-24 16:23:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2024-10-24 16:23:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 16:23:32,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:32,724 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:32,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-10-24 16:23:32,929 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-10-24 16:23:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-24 16:23:33,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:33,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1474874865, now seen corresponding path program 1 times [2024-10-24 16:23:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958228606] [2024-10-24 16:23:33,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:33,126 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-10-24 16:23:33,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:33,127 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-24 16:23:33,128 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 (21)] Waiting until timeout for monitored process [2024-10-24 16:23:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:33,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:23:33,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:33,300 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-10-24 16:23:33,304 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-10-24 16:23:33,534 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-10-24 16:23:33,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:33,556 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-10-24 16:23:33,564 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:33,564 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-10-24 16:23:33,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:33,655 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-10-24 16:23:33,665 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:33,666 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-10-24 16:23:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 4 not checked. [2024-10-24 16:23:33,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:33,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958228606] [2024-10-24 16:23:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958228606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989088134] [2024-10-24 16:23:33,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:33,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:33,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:33,977 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:33,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-10-24 16:23:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:34,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:23:34,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:34,429 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-10-24 16:23:34,432 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-10-24 16:23:34,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:34,598 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-10-24 16:23:34,605 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:34,605 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-10-24 16:23:34,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:34,657 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-10-24 16:23:34,663 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:34,664 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-10-24 16:23:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 104 trivial. 4 not checked. [2024-10-24 16:23:34,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [989088134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:34,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:34,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-10-24 16:23:34,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591216449] [2024-10-24 16:23:34,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:23:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:34,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:23:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=150, Unknown=1, NotChecked=24, Total=210 [2024-10-24 16:23:34,799 INFO L87 Difference]: Start difference. First operand 107 states and 133 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:35,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:35,174 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2024-10-24 16:23:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:23:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-24 16:23:35,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:35,176 INFO L225 Difference]: With dead ends: 117 [2024-10-24 16:23:35,176 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 16:23:35,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-10-24 16:23:35,176 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:35,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 229 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 257 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2024-10-24 16:23:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 16:23:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2024-10-24 16:23:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 93 states have internal predecessors, (108), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2024-10-24 16:23:35,184 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 48 [2024-10-24 16:23:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:35,184 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2024-10-24 16:23:35,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:23:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2024-10-24 16:23:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:23:35,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:35,188 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:35,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:35,394 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 (21)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:35,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /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-10-24 16:23:35,589 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:35,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:35,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1883887873, now seen corresponding path program 1 times [2024-10-24 16:23:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317592330] [2024-10-24 16:23:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:35,590 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-10-24 16:23:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:35,591 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-10-24 16:23:35,592 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-10-24 16:23:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:35,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:23:35,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:35,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:36,086 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 11 treesize of output 9 [2024-10-24 16:23:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:36,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317592330] [2024-10-24 16:23:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317592330] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:36,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:36,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 16:23:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406043186] [2024-10-24 16:23:36,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:36,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:36,286 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:37,062 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2024-10-24 16:23:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:23:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-10-24 16:23:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:37,064 INFO L225 Difference]: With dead ends: 130 [2024-10-24 16:23:37,064 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 16:23:37,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:23:37,065 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 61 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:37,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 321 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:23:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 16:23:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2024-10-24 16:23:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 92 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2024-10-24 16:23:37,072 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 49 [2024-10-24 16:23:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:37,072 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2024-10-24 16:23:37,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2024-10-24 16:23:37,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 16:23:37,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:37,075 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:37,081 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 (23)] Ended with exit code 0 [2024-10-24 16:23:37,275 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-10-24 16:23:37,275 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1729018087, now seen corresponding path program 1 times [2024-10-24 16:23:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770513987] [2024-10-24 16:23:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:37,276 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-10-24 16:23:37,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:37,277 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-10-24 16:23:37,278 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-10-24 16:23:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:37,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 16:23:37,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:37,534 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-10-24 16:23:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-24 16:23:37,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 16:23:37,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:37,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770513987] [2024-10-24 16:23:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770513987] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:37,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2024-10-24 16:23:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671030485] [2024-10-24 16:23:37,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:37,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:23:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:37,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:23:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:23:37,712 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 16:23:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:38,184 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2024-10-24 16:23:38,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:23:38,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (5), 2 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 50 [2024-10-24 16:23:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:38,186 INFO L225 Difference]: With dead ends: 126 [2024-10-24 16:23:38,186 INFO L226 Difference]: Without dead ends: 126 [2024-10-24 16:23:38,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2024-10-24 16:23:38,187 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:38,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 275 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:23:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-24 16:23:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2024-10-24 16:23:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 98 states have internal predecessors, (112), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2024-10-24 16:23:38,191 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 50 [2024-10-24 16:23:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:38,192 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2024-10-24 16:23:38,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 16:23:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2024-10-24 16:23:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:23:38,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:38,193 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:38,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:38,393 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-10-24 16:23:38,394 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:38,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2059953246, now seen corresponding path program 1 times [2024-10-24 16:23:38,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417121494] [2024-10-24 16:23:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:38,395 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-10-24 16:23:38,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:38,396 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-10-24 16:23:38,397 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-10-24 16:23:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:38,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:23:38,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:38,966 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-10-24 16:23:39,244 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 15 treesize of output 7 [2024-10-24 16:23:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:39,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 16:23:39,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:39,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417121494] [2024-10-24 16:23:39,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417121494] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:39,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:39,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 20 [2024-10-24 16:23:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361278979] [2024-10-24 16:23:39,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:39,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:23:39,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:39,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:23:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:23:39,492 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:41,070 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-10-24 16:23:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 16:23:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2024-10-24 16:23:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:41,072 INFO L225 Difference]: With dead ends: 124 [2024-10-24 16:23:41,072 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 16:23:41,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 16:23:41,073 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 89 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:41,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 263 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 16:23:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 16:23:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2024-10-24 16:23:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.202127659574468) internal successors, (113), 99 states have internal predecessors, (113), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 16:23:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2024-10-24 16:23:41,077 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 51 [2024-10-24 16:23:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:41,077 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2024-10-24 16:23:41,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 18 states have internal predecessors, (51), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2024-10-24 16:23:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:23:41,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:41,078 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:41,084 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 (25)] Ended with exit code 0 [2024-10-24 16:23:41,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:41,279 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -565958711, now seen corresponding path program 1 times [2024-10-24 16:23:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:41,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351760020] [2024-10-24 16:23:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:41,280 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-10-24 16:23:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:41,281 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:23:41,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-24 16:23:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:41,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:23:41,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:41,523 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-10-24 16:23:41,595 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-10-24 16:23:41,626 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 11 treesize of output 5 [2024-10-24 16:23:41,694 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-10-24 16:23:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:41,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:41,927 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:41,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:41,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351760020] [2024-10-24 16:23:41,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351760020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:41,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:41,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-10-24 16:23:41,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954321553] [2024-10-24 16:23:41,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:41,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:23:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:23:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:23:41,929 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 16:23:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:42,885 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2024-10-24 16:23:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:23:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2024-10-24 16:23:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:42,887 INFO L225 Difference]: With dead ends: 148 [2024-10-24 16:23:42,887 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 16:23:42,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 16:23:42,888 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 48 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:42,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 333 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:23:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 16:23:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2024-10-24 16:23:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 115 states have internal predecessors, (135), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2024-10-24 16:23:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2024-10-24 16:23:42,901 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 52 [2024-10-24 16:23:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:42,901 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2024-10-24 16:23:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-24 16:23:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2024-10-24 16:23:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:23:42,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:42,902 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:42,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-24 16:23:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:23:43,103 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:43,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1410430582, now seen corresponding path program 2 times [2024-10-24 16:23:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886159364] [2024-10-24 16:23:43,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:23:43,104 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-10-24 16:23:43,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:43,105 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-10-24 16:23:43,107 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-10-24 16:23:43,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:23:43,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:23:43,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:23:43,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-24 16:23:43,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:23:43,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886159364] [2024-10-24 16:23:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886159364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:23:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:23:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:23:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779301278] [2024-10-24 16:23:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:23:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:23:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:43,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:23:43,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:23:43,285 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-24 16:23:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:23:43,320 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-10-24 16:23:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:23:43,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 52 [2024-10-24 16:23:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:23:43,321 INFO L225 Difference]: With dead ends: 102 [2024-10-24 16:23:43,321 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 16:23:43,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-10-24 16:23:43,322 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:23:43,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:23:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 16:23:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-10-24 16:23:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 84 states have internal predecessors, (90), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:23:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-10-24 16:23:43,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 52 [2024-10-24 16:23:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:23:43,326 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-10-24 16:23:43,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-24 16:23:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-10-24 16:23:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 16:23:43,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:23:43,327 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:23:43,333 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 (27)] Ended with exit code 0 [2024-10-24 16:23:43,527 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-10-24 16:23:43,528 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:23:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:23:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -364850751, now seen corresponding path program 1 times [2024-10-24 16:23:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:23:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243794955] [2024-10-24 16:23:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:43,529 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-10-24 16:23:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:23:43,532 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-10-24 16:23:43,533 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-10-24 16:23:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:43,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 16:23:43,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:43,724 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-10-24 16:23:43,852 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:43,852 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-10-24 16:23:43,894 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 15 treesize of output 1 [2024-10-24 16:23:43,926 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 7 treesize of output 5 [2024-10-24 16:23:48,030 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 16 treesize of output 8 [2024-10-24 16:23:48,064 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-10-24 16:23:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:48,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:48,300 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-10-24 16:23:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-24 16:23:48,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243794955] [2024-10-24 16:23:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243794955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:23:48,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:23:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2024-10-24 16:23:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141324192] [2024-10-24 16:23:48,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:23:48,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:23:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:23:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:23:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=487, Unknown=1, NotChecked=0, Total=552 [2024-10-24 16:23:48,513 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:23:52,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:23:56,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:24:00,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:24:05,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:24:09,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:24:13,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:24:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:13,437 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-10-24 16:24:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 16:24:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-10-24 16:24:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:13,438 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:24:13,438 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:24:13,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=198, Invalid=1283, Unknown=1, NotChecked=0, Total=1482 [2024-10-24 16:24:13,439 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 92 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 20 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:13,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 267 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 496 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-10-24 16:24:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:24:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-10-24 16:24:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 88 states have internal predecessors, (95), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:24:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2024-10-24 16:24:13,443 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 53 [2024-10-24 16:24:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:13,443 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2024-10-24 16:24:13,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:24:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2024-10-24 16:24:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 16:24:13,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:13,444 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:13,451 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-10-24 16:24:13,645 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-10-24 16:24:13,645 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:24:13,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1565780325, now seen corresponding path program 1 times [2024-10-24 16:24:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078793012] [2024-10-24 16:24:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:13,646 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-10-24 16:24:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:13,647 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-10-24 16:24:13,648 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-10-24 16:24:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:13,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:24:13,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 16:24:13,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 16:24:13,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:13,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078793012] [2024-10-24 16:24:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078793012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:13,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-24 16:24:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862760630] [2024-10-24 16:24:13,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:24:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:24:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:24:13,891 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:24:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:13,982 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2024-10-24 16:24:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:24:13,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 55 [2024-10-24 16:24:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:13,983 INFO L225 Difference]: With dead ends: 105 [2024-10-24 16:24:13,983 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 16:24:13,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:24:13,984 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:13,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 16:24:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 16:24:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 94 states have internal predecessors, (101), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:24:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-10-24 16:24:13,987 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 55 [2024-10-24 16:24:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-10-24 16:24:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:24:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-10-24 16:24:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 16:24:13,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:13,988 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:13,993 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 (29)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:14,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:24:14,189 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:24:14,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:14,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2040170753, now seen corresponding path program 2 times [2024-10-24 16:24:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213213346] [2024-10-24 16:24:14,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:14,190 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-10-24 16:24:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:14,191 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10-24 16:24:14,192 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 (30)] Waiting until timeout for monitored process [2024-10-24 16:24:14,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:24:14,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:14,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:24:14,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:14,460 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-10-24 16:24:14,464 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-10-24 16:24:14,663 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-10-24 16:24:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:14,678 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-10-24 16:24:14,686 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:14,686 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-10-24 16:24:14,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:14,778 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-10-24 16:24:14,787 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:14,787 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-10-24 16:24:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:14,885 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-10-24 16:24:14,892 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:14,892 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-10-24 16:24:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 6 not checked. [2024-10-24 16:24:14,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:19,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213213346] [2024-10-24 16:24:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213213346] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:24:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [845417505] [2024-10-24 16:24:19,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:24:19,120 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:24:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:24:19,121 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:24:19,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-10-24 16:24:19,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:24:19,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:24:19,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-24 16:24:19,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:19,561 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-10-24 16:24:19,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-10-24 16:24:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:19,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 14 treesize of output 9 [2024-10-24 16:24:19,741 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:19,741 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-10-24 16:24:19,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:19,801 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-10-24 16:24:19,810 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:19,810 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-10-24 16:24:19,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:24:19,857 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-10-24 16:24:19,865 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:24:19,865 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-10-24 16:24:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 6 not checked. [2024-10-24 16:24:19,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [845417505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:24:24,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2024-10-24 16:24:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963455544] [2024-10-24 16:24:24,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:24:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:24:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=199, Unknown=2, NotChecked=28, Total=272 [2024-10-24 16:24:24,042 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:24,520 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2024-10-24 16:24:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:24:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 2 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 57 [2024-10-24 16:24:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:24,521 INFO L225 Difference]: With dead ends: 107 [2024-10-24 16:24:24,521 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 16:24:24,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2024-10-24 16:24:24,521 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:24,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 316 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 67 Unchecked, 0.3s Time] [2024-10-24 16:24:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 16:24:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-10-24 16:24:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 94 states have internal predecessors, (100), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:24:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2024-10-24 16:24:24,525 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 57 [2024-10-24 16:24:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:24,525 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2024-10-24 16:24:24,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:24:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2024-10-24 16:24:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 16:24:24,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:24,526 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:24,533 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 (30)] Ended with exit code 0 [2024-10-24 16:24:24,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-10-24 16:24:24,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 16:24:24,927 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:24:24,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1381489465, now seen corresponding path program 1 times [2024-10-24 16:24:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725489168] [2024-10-24 16:24:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:24,928 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-10-24 16:24:24,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:24,929 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10-24 16:24:24,930 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 (32)] Waiting until timeout for monitored process [2024-10-24 16:24:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:25,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:24:25,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-24 16:24:25,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:25,164 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-10-24 16:24:25,164 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 16 treesize of output 15 [2024-10-24 16:24:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-24 16:24:25,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:24:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725489168] [2024-10-24 16:24:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725489168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:24:25,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:24:25,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2024-10-24 16:24:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146086156] [2024-10-24 16:24:25,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:24:25,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:24:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:24:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:24:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:24:25,200 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:24:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:24:25,274 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2024-10-24 16:24:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:24:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2024-10-24 16:24:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:24:25,275 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:24:25,275 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:24:25,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-10-24 16:24:25,276 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:24:25,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:24:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:24:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2024-10-24 16:24:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 88 states have internal predecessors, (94), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:24:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2024-10-24 16:24:25,280 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 59 [2024-10-24 16:24:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:24:25,281 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2024-10-24 16:24:25,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:24:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2024-10-24 16:24:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 16:24:25,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:24:25,282 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:24:25,289 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 (32)] Ended with exit code 0 [2024-10-24 16:24:25,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-10-24 16:24:25,483 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:24:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:24:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 466485372, now seen corresponding path program 1 times [2024-10-24 16:24:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:24:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332272664] [2024-10-24 16:24:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:24:25,484 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-10-24 16:24:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:24:25,485 INFO L229 MonitoredProcess]: Starting monitored process 33 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-10-24 16:24:25,486 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 (33)] Waiting until timeout for monitored process [2024-10-24 16:24:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:24:25,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:24:25,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:24:26,098 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-10-24 16:24:26,159 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-24 16:24:26,159 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 37 treesize of output 29 [2024-10-24 16:24:26,286 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 38 treesize of output 22 [2024-10-24 16:24:34,780 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_34| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_34| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_34|) (_ bv0 1)))) is different from true [2024-10-24 16:24:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-24 16:24:34,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:24:39,099 INFO L349 Elim1Store]: treesize reduction 158, result has 4.8 percent of original size [2024-10-24 16:24:39,100 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 285 treesize of output 244