./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 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/uthash-2.0.2/uthash_SFH_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:19:53,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:19:53,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:19:53,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:19:53,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:19:53,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:19:53,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:19:53,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:19:53,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:19:53,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:19:53,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:19:53,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:19:53,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:19:53,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:19:53,846 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:19:53,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:19:53,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:19:53,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:19:53,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:19:53,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:19:53,847 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:19:53,852 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:19:53,852 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:19:53,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:19:53,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:19:53,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:19:53,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:19:53,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:19:53,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:19:53,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:19:53,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:19:53,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:19:53,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:19:53,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:19:53,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:19:53,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:19:53,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:19:53,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:19:53,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:19:53,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:19:53,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:19:53,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:19:53,857 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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2024-10-14 19:19:54,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:19:54,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:19:54,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:19:54,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:19:54,087 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:19:54,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2024-10-14 19:19:55,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:19:55,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:19:55,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2024-10-14 19:19:55,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d462457/f69173b87e17472a8c7ae222e1269802/FLAG53b19b374 [2024-10-14 19:19:55,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d462457/f69173b87e17472a8c7ae222e1269802 [2024-10-14 19:19:55,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:19:55,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:19:55,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:19:55,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:19:55,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:19:55,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:55" (1/1) ... [2024-10-14 19:19:55,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11661ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:55, skipping insertion in model container [2024-10-14 19:19:55,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:55" (1/1) ... [2024-10-14 19:19:55,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:19:56,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:19:56,254 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-14 19:19:56,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ae5d2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:56, skipping insertion in model container [2024-10-14 19:19:56,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:19:56,263 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:19:56,264 INFO L158 Benchmark]: Toolchain (without parser) took 483.49ms. Allocated memory is still 197.1MB. Free memory was 167.6MB in the beginning and 145.9MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:19:56,265 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:19:56,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.86ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 145.9MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:19:56,266 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.12ms. Allocated memory is still 134.2MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 480.86ms. Allocated memory is still 197.1MB. Free memory was 166.8MB in the beginning and 145.9MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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/uthash-2.0.2/uthash_SFH_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:19:58,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:19:58,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:19:58,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:19:58,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:19:58,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:19:58,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:19:58,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:19:58,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:19:58,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:19:58,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:19:58,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:19:58,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:19:58,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:19:58,176 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:19:58,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:19:58,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:19:58,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:19:58,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:19:58,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:19:58,177 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:19:58,178 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:19:58,178 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:19:58,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:19:58,178 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:19:58,178 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:19:58,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:19:58,179 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:19:58,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:19:58,179 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:19:58,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:19:58,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:19:58,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:19:58,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:19:58,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:19:58,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:19:58,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:19:58,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:19:58,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:19:58,182 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:19:58,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:19:58,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:19:58,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:19:58,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:19:58,185 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:19:58,186 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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2024-10-14 19:19:58,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:19:58,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:19:58,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:19:58,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:19:58,518 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:19:58,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2024-10-14 19:19:59,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:20:00,134 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:20:00,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2024-10-14 19:20:00,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae88a2a0c/aaa7cbd06a7b454c927c09865507b8cc/FLAG33b0292d5 [2024-10-14 19:20:00,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae88a2a0c/aaa7cbd06a7b454c927c09865507b8cc [2024-10-14 19:20:00,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:20:00,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:20:00,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:20:00,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:20:00,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:20:00,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:20:00" (1/1) ... [2024-10-14 19:20:00,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21546cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:00, skipping insertion in model container [2024-10-14 19:20:00,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:20:00" (1/1) ... [2024-10-14 19:20:00,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:20:00,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:20:00,958 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:20:00,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:20:01,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:20:01,029 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:20:01,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:20:01,142 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:20:01,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01 WrapperNode [2024-10-14 19:20:01,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:20:01,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:20:01,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:20:01,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:20:01,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,233 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-10-14 19:20:01,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:20:01,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:20:01,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:20:01,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:20:01,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,360 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-14 19:20:01,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:20:01,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:20:01,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:20:01,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:20:01,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (1/1) ... [2024-10-14 19:20:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:20:01,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:20:01,490 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-14 19:20:01,493 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-14 19:20:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:20:01,529 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:20:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:20:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:20:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:20:01,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:20:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:20:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:20:01,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:20:01,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:20:01,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:20:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:20:01,747 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:20:01,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:20:01,765 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:20:01,796 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:20:01,816 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:20:05,122 INFO L? ?]: Removed 1295 outVars from TransFormulas that were not future-live. [2024-10-14 19:20:05,122 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:20:05,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:20:05,250 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-14 19:20:05,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:20:05 BoogieIcfgContainer [2024-10-14 19:20:05,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:20:05,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:20:05,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:20:05,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:20:05,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:20:00" (1/3) ... [2024-10-14 19:20:05,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc18c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:20:05, skipping insertion in model container [2024-10-14 19:20:05,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:20:01" (2/3) ... [2024-10-14 19:20:05,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc18c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:20:05, skipping insertion in model container [2024-10-14 19:20:05,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:20:05" (3/3) ... [2024-10-14 19:20:05,257 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-2.i [2024-10-14 19:20:05,269 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:20:05,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-10-14 19:20:05,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:20:05,323 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;@5ed399f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:20:05,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-10-14 19:20:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 1133 states, 500 states have (on average 2.536) internal successors, (1268), 1126 states have internal predecessors, (1268), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 19:20:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:20:05,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:05,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:20:05,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:05,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 62474, now seen corresponding path program 1 times [2024-10-14 19:20:05,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820295528] [2024-10-14 19:20:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:05,347 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-14 19:20:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:05,350 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-14 19:20:05,352 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-14 19:20:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:05,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:05,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:05,492 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-14 19:20:05,502 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-14 19:20:05,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:05,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820295528] [2024-10-14 19:20:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820295528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:20:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736390141] [2024-10-14 19:20:05,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:05,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:05,534 INFO L87 Difference]: Start difference. First operand has 1133 states, 500 states have (on average 2.536) internal successors, (1268), 1126 states have internal predecessors, (1268), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:07,075 INFO L93 Difference]: Finished difference Result 1289 states and 1365 transitions. [2024-10-14 19:20:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:20:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:07,090 INFO L225 Difference]: With dead ends: 1289 [2024-10-14 19:20:07,090 INFO L226 Difference]: Without dead ends: 1288 [2024-10-14 19:20:07,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:07,095 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 1044 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:07,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 749 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:20:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-14 19:20:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1116. [2024-10-14 19:20:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 502 states have (on average 2.3406374501992033) internal successors, (1175), 1110 states have internal predecessors, (1175), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1183 transitions. [2024-10-14 19:20:07,158 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1183 transitions. Word has length 2 [2024-10-14 19:20:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:07,158 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1183 transitions. [2024-10-14 19:20:07,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1183 transitions. [2024-10-14 19:20:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:20:07,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:07,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:20:07,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:20:07,360 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-14 19:20:07,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 62475, now seen corresponding path program 1 times [2024-10-14 19:20:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024251802] [2024-10-14 19:20:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:07,361 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-14 19:20:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:07,379 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-14 19:20:07,380 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-14 19:20:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:07,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:20:07,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:07,467 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-14 19:20:07,478 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-14 19:20:07,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:07,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:07,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024251802] [2024-10-14 19:20:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024251802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:20:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966450583] [2024-10-14 19:20:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:07,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:07,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:07,481 INFO L87 Difference]: Start difference. First operand 1116 states and 1183 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:09,793 INFO L93 Difference]: Finished difference Result 1660 states and 1770 transitions. [2024-10-14 19:20:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:09,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 19:20:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:09,798 INFO L225 Difference]: With dead ends: 1660 [2024-10-14 19:20:09,798 INFO L226 Difference]: Without dead ends: 1660 [2024-10-14 19:20:09,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:09,799 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 584 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:09,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1392 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 19:20:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-10-14 19:20:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1289. [2024-10-14 19:20:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 676 states have (on average 2.3106508875739644) internal successors, (1562), 1283 states have internal predecessors, (1562), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1570 transitions. [2024-10-14 19:20:09,825 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1570 transitions. Word has length 2 [2024-10-14 19:20:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1570 transitions. [2024-10-14 19:20:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1570 transitions. [2024-10-14 19:20:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:20:09,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:09,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:20:09,836 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-14 19:20:10,027 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-14 19:20:10,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1861944980, now seen corresponding path program 1 times [2024-10-14 19:20:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792278944] [2024-10-14 19:20:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:10,029 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-14 19:20:10,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:10,036 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-14 19:20:10,038 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-14 19:20:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:10,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:20:10,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:10,245 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-14 19:20:10,253 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-14 19:20:10,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:20:10,348 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-14 19:20:10,364 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:20:10,365 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-14 19:20:10,387 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-14 19:20:10,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:10,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792278944] [2024-10-14 19:20:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792278944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:20:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208834720] [2024-10-14 19:20:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:10,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:10,390 INFO L87 Difference]: Start difference. First operand 1289 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:12,781 INFO L93 Difference]: Finished difference Result 1455 states and 1747 transitions. [2024-10-14 19:20:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 19:20:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:12,795 INFO L225 Difference]: With dead ends: 1455 [2024-10-14 19:20:12,795 INFO L226 Difference]: Without dead ends: 1455 [2024-10-14 19:20:12,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:12,796 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1322 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:12,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 379 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 19:20:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-14 19:20:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1104. [2024-10-14 19:20:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 502 states have (on average 2.314741035856574) internal successors, (1162), 1098 states have internal predecessors, (1162), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1170 transitions. [2024-10-14 19:20:12,863 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1170 transitions. Word has length 6 [2024-10-14 19:20:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1170 transitions. [2024-10-14 19:20:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1170 transitions. [2024-10-14 19:20:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:20:12,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:12,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:12,873 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-14 19:20:13,071 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-14 19:20:13,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:13,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1885719534, now seen corresponding path program 1 times [2024-10-14 19:20:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:13,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062895929] [2024-10-14 19:20:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:13,073 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-14 19:20:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:13,079 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-14 19:20:13,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:20:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:13,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:20:13,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:13,225 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-14 19:20:13,261 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-14 19:20:13,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:13,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062895929] [2024-10-14 19:20:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062895929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:20:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138416606] [2024-10-14 19:20:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:13,265 INFO L87 Difference]: Start difference. First operand 1104 states and 1170 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:15,928 INFO L93 Difference]: Finished difference Result 1527 states and 1630 transitions. [2024-10-14 19:20:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:20:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:15,933 INFO L225 Difference]: With dead ends: 1527 [2024-10-14 19:20:15,933 INFO L226 Difference]: Without dead ends: 1527 [2024-10-14 19:20:15,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:15,939 INFO L432 NwaCegarLoop]: 1138 mSDtfsCounter, 623 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:15,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1566 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 19:20:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-10-14 19:20:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1121. [2024-10-14 19:20:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 529 states have (on average 2.3062381852551983) internal successors, (1220), 1115 states have internal predecessors, (1220), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1228 transitions. [2024-10-14 19:20:15,986 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1228 transitions. Word has length 7 [2024-10-14 19:20:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:15,987 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1228 transitions. [2024-10-14 19:20:15,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1228 transitions. [2024-10-14 19:20:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:20:15,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:15,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:15,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 19:20:16,190 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-14 19:20:16,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1885719533, now seen corresponding path program 1 times [2024-10-14 19:20:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722084496] [2024-10-14 19:20:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:16,193 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-14 19:20:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:16,195 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-14 19:20:16,197 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-14 19:20:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:16,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:16,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:16,315 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-14 19:20:16,325 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-14 19:20:16,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:16,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722084496] [2024-10-14 19:20:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722084496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:16,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:20:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650227885] [2024-10-14 19:20:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:16,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:16,328 INFO L87 Difference]: Start difference. First operand 1121 states and 1228 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:18,145 INFO L93 Difference]: Finished difference Result 1422 states and 1555 transitions. [2024-10-14 19:20:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 19:20:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:18,149 INFO L225 Difference]: With dead ends: 1422 [2024-10-14 19:20:18,152 INFO L226 Difference]: Without dead ends: 1422 [2024-10-14 19:20:18,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:18,153 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 830 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:18,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1235 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:20:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-10-14 19:20:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1074. [2024-10-14 19:20:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 529 states have (on average 2.2098298676748582) internal successors, (1169), 1068 states have internal predecessors, (1169), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1177 transitions. [2024-10-14 19:20:18,181 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1177 transitions. Word has length 7 [2024-10-14 19:20:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:18,185 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1177 transitions. [2024-10-14 19:20:18,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1177 transitions. [2024-10-14 19:20:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:20:18,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:18,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:18,191 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-14 19:20:18,386 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-14 19:20:18,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:18,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 270035494, now seen corresponding path program 1 times [2024-10-14 19:20:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287231959] [2024-10-14 19:20:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:18,388 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-14 19:20:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:18,390 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-14 19:20:18,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:20:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:18,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:20:18,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:18,572 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-14 19:20:18,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:18,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287231959] [2024-10-14 19:20:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287231959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:18,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:18,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692636015] [2024-10-14 19:20:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:18,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:18,578 INFO L87 Difference]: Start difference. First operand 1074 states and 1177 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:20,149 INFO L93 Difference]: Finished difference Result 1611 states and 1798 transitions. [2024-10-14 19:20:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 19:20:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:20,155 INFO L225 Difference]: With dead ends: 1611 [2024-10-14 19:20:20,155 INFO L226 Difference]: Without dead ends: 1611 [2024-10-14 19:20:20,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-14 19:20:20,156 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 572 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:20,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 2950 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:20:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-10-14 19:20:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1278. [2024-10-14 19:20:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 733 states have (on average 2.1664392905866303) internal successors, (1588), 1272 states have internal predecessors, (1588), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1596 transitions. [2024-10-14 19:20:20,180 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1596 transitions. Word has length 12 [2024-10-14 19:20:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1596 transitions. [2024-10-14 19:20:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1596 transitions. [2024-10-14 19:20:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:20:20,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:20,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:20,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:20:20,381 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-14 19:20:20,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash -322964451, now seen corresponding path program 1 times [2024-10-14 19:20:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741839970] [2024-10-14 19:20:20,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:20,383 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-14 19:20:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:20,384 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-14 19:20:20,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 (8)] Waiting until timeout for monitored process [2024-10-14 19:20:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:20,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:20:20,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:20,511 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-14 19:20:20,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:20,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:20,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741839970] [2024-10-14 19:20:20,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741839970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:20,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:20,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:20,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291849093] [2024-10-14 19:20:20,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:20,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:20,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:20,513 INFO L87 Difference]: Start difference. First operand 1278 states and 1596 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:21,004 INFO L93 Difference]: Finished difference Result 1224 states and 1516 transitions. [2024-10-14 19:20:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 19:20:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:21,014 INFO L225 Difference]: With dead ends: 1224 [2024-10-14 19:20:21,015 INFO L226 Difference]: Without dead ends: 1224 [2024-10-14 19:20:21,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:21,015 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 61 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:21,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1834 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:20:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-10-14 19:20:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2024-10-14 19:20:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 703 states have (on average 2.1450924608819344) internal successors, (1508), 1218 states have internal predecessors, (1508), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1516 transitions. [2024-10-14 19:20:21,051 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1516 transitions. Word has length 12 [2024-10-14 19:20:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:21,052 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1516 transitions. [2024-10-14 19:20:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1516 transitions. [2024-10-14 19:20:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:20:21,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:21,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:21,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:20:21,253 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-14 19:20:21,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1131166537, now seen corresponding path program 1 times [2024-10-14 19:20:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321386115] [2024-10-14 19:20:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:21,257 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-14 19:20:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:21,258 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-14 19:20:21,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:20:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:21,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:21,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:21,398 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-14 19:20:21,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:21,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321386115] [2024-10-14 19:20:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321386115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324727520] [2024-10-14 19:20:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:21,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:21,401 INFO L87 Difference]: Start difference. First operand 1224 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:22,218 INFO L93 Difference]: Finished difference Result 1208 states and 1472 transitions. [2024-10-14 19:20:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:20:22,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 19:20:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:22,223 INFO L225 Difference]: With dead ends: 1208 [2024-10-14 19:20:22,223 INFO L226 Difference]: Without dead ends: 1208 [2024-10-14 19:20:22,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-14 19:20:22,224 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 45 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:22,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2703 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:20:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-10-14 19:20:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-10-14 19:20:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 701 states have (on average 2.0884450784593436) internal successors, (1464), 1202 states have internal predecessors, (1464), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1472 transitions. [2024-10-14 19:20:22,244 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1472 transitions. Word has length 14 [2024-10-14 19:20:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1472 transitions. [2024-10-14 19:20:22,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1472 transitions. [2024-10-14 19:20:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:20:22,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:22,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:22,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:20:22,445 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-14 19:20:22,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr626ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -371880063, now seen corresponding path program 1 times [2024-10-14 19:20:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454641874] [2024-10-14 19:20:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:22,447 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-14 19:20:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:22,451 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-14 19:20:22,452 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-14 19:20:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:22,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:20:22,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:22,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:20:22,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:20:22,624 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 33 treesize of output 31 [2024-10-14 19:20:22,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:20:22,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-10-14 19:20:22,671 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-14 19:20:22,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:22,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:22,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454641874] [2024-10-14 19:20:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454641874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:22,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:22,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973666682] [2024-10-14 19:20:22,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:22,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:22,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:22,673 INFO L87 Difference]: Start difference. First operand 1208 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:24,305 INFO L93 Difference]: Finished difference Result 2148 states and 2510 transitions. [2024-10-14 19:20:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:24,306 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:20:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:24,310 INFO L225 Difference]: With dead ends: 2148 [2024-10-14 19:20:24,310 INFO L226 Difference]: Without dead ends: 2148 [2024-10-14 19:20:24,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-14 19:20:24,311 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 979 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:24,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 2744 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:20:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2024-10-14 19:20:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1207. [2024-10-14 19:20:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 700 states have (on average 2.0885714285714285) internal successors, (1462), 1201 states have internal predecessors, (1462), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1470 transitions. [2024-10-14 19:20:24,328 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1470 transitions. Word has length 15 [2024-10-14 19:20:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1470 transitions. [2024-10-14 19:20:24,328 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1470 transitions. [2024-10-14 19:20:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:20:24,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:24,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:24,334 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 (10)] Ended with exit code 0 [2024-10-14 19:20:24,529 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-14 19:20:24,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1679153540, now seen corresponding path program 1 times [2024-10-14 19:20:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:24,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772536964] [2024-10-14 19:20:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:24,531 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-14 19:20:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:24,532 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-14 19:20:24,534 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-14 19:20:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:24,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:20:24,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:24,668 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-14 19:20:24,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:24,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772536964] [2024-10-14 19:20:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772536964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495587685] [2024-10-14 19:20:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:24,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:20:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:20:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:24,670 INFO L87 Difference]: Start difference. First operand 1207 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:25,217 INFO L93 Difference]: Finished difference Result 1153 states and 1390 transitions. [2024-10-14 19:20:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:20:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:20:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:25,222 INFO L225 Difference]: With dead ends: 1153 [2024-10-14 19:20:25,222 INFO L226 Difference]: Without dead ends: 1153 [2024-10-14 19:20:25,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:20:25,223 INFO L432 NwaCegarLoop]: 880 mSDtfsCounter, 61 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:25,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1718 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:20:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-14 19:20:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2024-10-14 19:20:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 670 states have (on average 2.062686567164179) internal successors, (1382), 1147 states have internal predecessors, (1382), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1390 transitions. [2024-10-14 19:20:25,254 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1390 transitions. Word has length 15 [2024-10-14 19:20:25,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:25,258 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1390 transitions. [2024-10-14 19:20:25,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1390 transitions. [2024-10-14 19:20:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:20:25,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:25,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:25,270 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-14 19:20:25,459 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-14 19:20:25,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1241154114, now seen corresponding path program 1 times [2024-10-14 19:20:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31724756] [2024-10-14 19:20:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:25,465 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-14 19:20:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:25,472 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-14 19:20:25,473 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-14 19:20:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:25,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:25,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:25,676 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-14 19:20:25,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:25,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:25,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31724756] [2024-10-14 19:20:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31724756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:25,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243486433] [2024-10-14 19:20:25,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:25,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:25,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:25,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:25,679 INFO L87 Difference]: Start difference. First operand 1153 states and 1390 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:26,475 INFO L93 Difference]: Finished difference Result 1137 states and 1346 transitions. [2024-10-14 19:20:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:20:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 19:20:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:26,479 INFO L225 Difference]: With dead ends: 1137 [2024-10-14 19:20:26,479 INFO L226 Difference]: Without dead ends: 1137 [2024-10-14 19:20:26,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-14 19:20:26,480 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 45 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:26,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2529 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:20:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-14 19:20:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2024-10-14 19:20:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 668 states have (on average 2.002994011976048) internal successors, (1338), 1131 states have internal predecessors, (1338), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1346 transitions. [2024-10-14 19:20:26,491 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1346 transitions. Word has length 17 [2024-10-14 19:20:26,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:26,492 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1346 transitions. [2024-10-14 19:20:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1346 transitions. [2024-10-14 19:20:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:20:26,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:26,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:26,499 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 (12)] Ended with exit code 0 [2024-10-14 19:20:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 19:20:26,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash -77809332, now seen corresponding path program 1 times [2024-10-14 19:20:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139352686] [2024-10-14 19:20:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:26,694 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-14 19:20:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:26,697 INFO L229 MonitoredProcess]: Starting monitored process 13 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-14 19:20:26,698 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 (13)] Waiting until timeout for monitored process [2024-10-14 19:20:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:26,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:20:26,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:26,835 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-14 19:20:26,887 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-14 19:20:26,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:26,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139352686] [2024-10-14 19:20:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139352686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:26,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322470071] [2024-10-14 19:20:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:26,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:26,890 INFO L87 Difference]: Start difference. First operand 1137 states and 1346 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:28,461 INFO L93 Difference]: Finished difference Result 1495 states and 1817 transitions. [2024-10-14 19:20:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:20:28,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:28,465 INFO L225 Difference]: With dead ends: 1495 [2024-10-14 19:20:28,465 INFO L226 Difference]: Without dead ends: 1495 [2024-10-14 19:20:28,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:20:28,466 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 704 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:28,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1218 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:20:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-10-14 19:20:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1133. [2024-10-14 19:20:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 668 states have (on average 1.9910179640718564) internal successors, (1330), 1127 states have internal predecessors, (1330), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1338 transitions. [2024-10-14 19:20:28,491 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1338 transitions. Word has length 31 [2024-10-14 19:20:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:28,491 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1338 transitions. [2024-10-14 19:20:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1338 transitions. [2024-10-14 19:20:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:20:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:28,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:28,497 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 (13)] Ended with exit code 0 [2024-10-14 19:20:28,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-14 19:20:28,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:28,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash -77809331, now seen corresponding path program 1 times [2024-10-14 19:20:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294886314] [2024-10-14 19:20:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:28,696 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-14 19:20:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:28,699 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-14 19:20:28,703 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-14 19:20:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:28,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:20:28,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:28,858 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-14 19:20:28,991 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-14 19:20:28,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:28,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294886314] [2024-10-14 19:20:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294886314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168811547] [2024-10-14 19:20:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:28,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:28,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:28,993 INFO L87 Difference]: Start difference. First operand 1133 states and 1338 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:31,757 INFO L93 Difference]: Finished difference Result 1601 states and 1900 transitions. [2024-10-14 19:20:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:31,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 19:20:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:31,767 INFO L225 Difference]: With dead ends: 1601 [2024-10-14 19:20:31,767 INFO L226 Difference]: Without dead ends: 1601 [2024-10-14 19:20:31,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:20:31,768 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 493 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:31,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 2088 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 19:20:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-10-14 19:20:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1129. [2024-10-14 19:20:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 668 states have (on average 1.9790419161676647) internal successors, (1322), 1123 states have internal predecessors, (1322), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1330 transitions. [2024-10-14 19:20:31,788 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1330 transitions. Word has length 31 [2024-10-14 19:20:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1330 transitions. [2024-10-14 19:20:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1330 transitions. [2024-10-14 19:20:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 19:20:31,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:31,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:31,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 19:20:31,993 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-14 19:20:31,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash 45408380, now seen corresponding path program 1 times [2024-10-14 19:20:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090208289] [2024-10-14 19:20:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:31,996 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-14 19:20:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:31,999 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-14 19:20:31,999 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-14 19:20:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:32,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:32,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:32,235 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-14 19:20:32,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:32,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090208289] [2024-10-14 19:20:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090208289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:32,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990603081] [2024-10-14 19:20:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:32,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:32,237 INFO L87 Difference]: Start difference. First operand 1129 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:33,090 INFO L93 Difference]: Finished difference Result 1117 states and 1310 transitions. [2024-10-14 19:20:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:20:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 19:20:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:33,094 INFO L225 Difference]: With dead ends: 1117 [2024-10-14 19:20:33,094 INFO L226 Difference]: Without dead ends: 1117 [2024-10-14 19:20:33,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-14 19:20:33,095 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 15 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:33,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2512 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:20:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-14 19:20:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2024-10-14 19:20:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 656 states have (on average 1.9847560975609757) internal successors, (1302), 1111 states have internal predecessors, (1302), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1310 transitions. [2024-10-14 19:20:33,109 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1310 transitions. Word has length 50 [2024-10-14 19:20:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:33,110 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1310 transitions. [2024-10-14 19:20:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1310 transitions. [2024-10-14 19:20:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:20:33,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:33,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:33,120 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-14 19:20:33,311 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-14 19:20:33,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:33,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -692970853, now seen corresponding path program 1 times [2024-10-14 19:20:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:33,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468258997] [2024-10-14 19:20:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:33,312 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-14 19:20:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:33,314 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-14 19:20:33,315 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-14 19:20:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:33,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:20:33,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:33,638 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-14 19:20:33,644 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-14 19:20:33,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:20:33,996 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-14 19:20:34,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:20:34,008 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-14 19:20:34,019 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-14 19:20:34,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:34,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468258997] [2024-10-14 19:20:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468258997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:34,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:34,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:20:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295342353] [2024-10-14 19:20:34,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:34,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:34,021 INFO L87 Difference]: Start difference. First operand 1117 states and 1310 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:36,103 INFO L93 Difference]: Finished difference Result 1433 states and 1743 transitions. [2024-10-14 19:20:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:36,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 19:20:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:36,107 INFO L225 Difference]: With dead ends: 1433 [2024-10-14 19:20:36,107 INFO L226 Difference]: Without dead ends: 1433 [2024-10-14 19:20:36,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:36,108 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 954 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:36,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 620 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 19:20:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-14 19:20:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1052. [2024-10-14 19:20:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 629 states have (on average 1.9077901430842608) internal successors, (1200), 1046 states have internal predecessors, (1200), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1208 transitions. [2024-10-14 19:20:36,118 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1208 transitions. Word has length 54 [2024-10-14 19:20:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:36,118 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1208 transitions. [2024-10-14 19:20:36,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1208 transitions. [2024-10-14 19:20:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:20:36,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:36,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 19:20:36,128 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-14 19:20:36,323 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-14 19:20:36,324 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 26610228, now seen corresponding path program 1 times [2024-10-14 19:20:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378543989] [2024-10-14 19:20:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:36,325 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-14 19:20:36,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:36,328 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-14 19:20:36,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:20:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:36,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:20:36,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:36,557 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-14 19:20:36,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:20:36,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:20:36,598 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-14 19:20:36,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:36,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378543989] [2024-10-14 19:20:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378543989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:36,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:36,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422005345] [2024-10-14 19:20:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:20:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:20:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:20:36,601 INFO L87 Difference]: Start difference. First operand 1052 states and 1208 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:38,398 INFO L93 Difference]: Finished difference Result 1051 states and 1207 transitions. [2024-10-14 19:20:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:20:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 19:20:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:38,419 INFO L225 Difference]: With dead ends: 1051 [2024-10-14 19:20:38,419 INFO L226 Difference]: Without dead ends: 1051 [2024-10-14 19:20:38,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:20:38,420 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 2 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:38,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2111 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:20:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-14 19:20:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-14 19:20:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 629 states have (on average 1.9062003179650238) internal successors, (1199), 1045 states have internal predecessors, (1199), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1207 transitions. [2024-10-14 19:20:38,437 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1207 transitions. Word has length 58 [2024-10-14 19:20:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1207 transitions. [2024-10-14 19:20:38,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:38,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1207 transitions. [2024-10-14 19:20:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:20:38,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:38,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 19:20:38,445 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-14 19:20:38,639 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-14 19:20:38,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash 26610229, now seen corresponding path program 1 times [2024-10-14 19:20:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938266000] [2024-10-14 19:20:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:38,641 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-14 19:20:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:38,644 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-14 19:20:38,645 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-14 19:20:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:38,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:20:38,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:38,911 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-14 19:20:38,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:20:38,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:20:38,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:20:38,970 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-14 19:20:38,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:38,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938266000] [2024-10-14 19:20:38,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938266000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:38,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:38,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498222093] [2024-10-14 19:20:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:38,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:20:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:20:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:20:38,971 INFO L87 Difference]: Start difference. First operand 1051 states and 1207 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:41,336 INFO L93 Difference]: Finished difference Result 1050 states and 1206 transitions. [2024-10-14 19:20:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:20:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-14 19:20:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:41,340 INFO L225 Difference]: With dead ends: 1050 [2024-10-14 19:20:41,340 INFO L226 Difference]: Without dead ends: 1050 [2024-10-14 19:20:41,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:20:41,341 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:41,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2163 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 19:20:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-10-14 19:20:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2024-10-14 19:20:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 628 states have (on average 1.9076433121019107) internal successors, (1198), 1044 states have internal predecessors, (1198), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:20:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1206 transitions. [2024-10-14 19:20:41,354 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1206 transitions. Word has length 58 [2024-10-14 19:20:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:41,354 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1206 transitions. [2024-10-14 19:20:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:20:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1206 transitions. [2024-10-14 19:20:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:20:41,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:41,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:41,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 19:20:41,561 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-14 19:20:41,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:41,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1411906232, now seen corresponding path program 1 times [2024-10-14 19:20:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776739248] [2024-10-14 19:20:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:41,566 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-14 19:20:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:41,569 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-14 19:20:41,578 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-14 19:20:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:41,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:20:41,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:41,829 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-14 19:20:41,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:20:41,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776739248] [2024-10-14 19:20:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776739248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:20:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:20:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:20:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059511998] [2024-10-14 19:20:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:20:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:20:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:20:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:20:41,831 INFO L87 Difference]: Start difference. First operand 1050 states and 1206 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-14 19:20:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:42,435 INFO L93 Difference]: Finished difference Result 1052 states and 1209 transitions. [2024-10-14 19:20:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:20:42,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 19:20:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:42,445 INFO L225 Difference]: With dead ends: 1052 [2024-10-14 19:20:42,445 INFO L226 Difference]: Without dead ends: 1052 [2024-10-14 19:20:42,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-14 19:20:42,446 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 0 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:42,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2448 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:20:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-10-14 19:20:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2024-10-14 19:20:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 629 states have (on average 1.9077901430842608) internal successors, (1200), 1046 states have internal predecessors, (1200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:20:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1209 transitions. [2024-10-14 19:20:42,475 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1209 transitions. Word has length 64 [2024-10-14 19:20:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:42,475 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1209 transitions. [2024-10-14 19:20:42,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-14 19:20:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1209 transitions. [2024-10-14 19:20:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:20:42,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:42,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:42,490 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 (19)] Ended with exit code 0 [2024-10-14 19:20:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:20:42,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:42,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 511692994, now seen corresponding path program 1 times [2024-10-14 19:20:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805892435] [2024-10-14 19:20:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:20:42,678 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-14 19:20:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:42,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:20:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:20:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:20:42,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:20:42,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:42,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:20:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:42,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805892435] [2024-10-14 19:20:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805892435] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:20:42,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:20:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:20:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822089401] [2024-10-14 19:20:42,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:20:42,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:20:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:20:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:20:42,985 INFO L87 Difference]: Start difference. First operand 1052 states and 1209 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:43,758 INFO L93 Difference]: Finished difference Result 1061 states and 1223 transitions. [2024-10-14 19:20:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:20:43,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-14 19:20:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:43,762 INFO L225 Difference]: With dead ends: 1061 [2024-10-14 19:20:43,762 INFO L226 Difference]: Without dead ends: 1061 [2024-10-14 19:20:43,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:20:43,763 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 4 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:43,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2446 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:20:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-10-14 19:20:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1060. [2024-10-14 19:20:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 636 states have (on average 1.9072327044025157) internal successors, (1213), 1053 states have internal predecessors, (1213), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:20:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1222 transitions. [2024-10-14 19:20:43,773 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1222 transitions. Word has length 65 [2024-10-14 19:20:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:43,773 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1222 transitions. [2024-10-14 19:20:43,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1222 transitions. [2024-10-14 19:20:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:20:43,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:43,774 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:43,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:20:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:20:43,975 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 376581432, now seen corresponding path program 2 times [2024-10-14 19:20:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302408635] [2024-10-14 19:20:43,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:20:43,975 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-14 19:20:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:43,978 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-14 19:20:43,984 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-14 19:20:44,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:20:44,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:20:44,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:20:44,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:44,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:20:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:44,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302408635] [2024-10-14 19:20:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302408635] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:20:44,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:20:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:20:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986758213] [2024-10-14 19:20:44,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:20:44,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:20:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:20:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:20:44,550 INFO L87 Difference]: Start difference. First operand 1060 states and 1222 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:46,092 INFO L93 Difference]: Finished difference Result 1072 states and 1241 transitions. [2024-10-14 19:20:46,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:20:46,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-14 19:20:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:46,097 INFO L225 Difference]: With dead ends: 1072 [2024-10-14 19:20:46,097 INFO L226 Difference]: Without dead ends: 1070 [2024-10-14 19:20:46,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:20:46,098 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 8 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:46,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4891 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:20:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-14 19:20:46,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1069. [2024-10-14 19:20:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 645 states have (on average 1.8992248062015504) internal successors, (1225), 1062 states have internal predecessors, (1225), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:20:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1234 transitions. [2024-10-14 19:20:46,110 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1234 transitions. Word has length 68 [2024-10-14 19:20:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:46,110 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1234 transitions. [2024-10-14 19:20:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1234 transitions. [2024-10-14 19:20:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:20:46,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:46,111 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:46,121 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-14 19:20:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 19:20:46,316 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:46,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -987455240, now seen corresponding path program 3 times [2024-10-14 19:20:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792563474] [2024-10-14 19:20:46,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:20:46,317 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-14 19:20:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:46,320 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:20:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:20:46,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:20:46,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:20:46,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:20:46,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:47,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:20:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:47,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792563474] [2024-10-14 19:20:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792563474] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:20:47,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:20:47,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:20:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269634646] [2024-10-14 19:20:47,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:20:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:20:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:20:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:20:47,459 INFO L87 Difference]: Start difference. First operand 1069 states and 1234 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:20:51,323 INFO L93 Difference]: Finished difference Result 1090 states and 1270 transitions. [2024-10-14 19:20:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:20:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-14 19:20:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:20:51,327 INFO L225 Difference]: With dead ends: 1090 [2024-10-14 19:20:51,327 INFO L226 Difference]: Without dead ends: 1087 [2024-10-14 19:20:51,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:20:51,328 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 14 mSDsluCounter, 9777 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10593 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:20:51,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10593 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 19:20:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-14 19:20:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2024-10-14 19:20:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 663 states have (on average 1.8823529411764706) internal successors, (1248), 1080 states have internal predecessors, (1248), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:20:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1257 transitions. [2024-10-14 19:20:51,342 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1257 transitions. Word has length 74 [2024-10-14 19:20:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:20:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1257 transitions. [2024-10-14 19:20:51,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:20:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1257 transitions. [2024-10-14 19:20:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:20:51,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:20:51,343 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:20:51,352 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 (22)] Forceful destruction successful, exit code 0 [2024-10-14 19:20:51,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:20:51,548 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:20:51,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:20:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash 830740600, now seen corresponding path program 4 times [2024-10-14 19:20:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:20:51,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32761181] [2024-10-14 19:20:51,549 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:20:51,549 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-14 19:20:51,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:20:51,550 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-14 19:20:51,555 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-14 19:20:52,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:20:52,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:20:52,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:20:52,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:20:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:52,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:20:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:20:53,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:20:53,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32761181] [2024-10-14 19:20:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32761181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:20:53,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:20:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:20:53,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604686943] [2024-10-14 19:20:53,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:20:53,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:20:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:20:53,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:20:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:20:53,665 INFO L87 Difference]: Start difference. First operand 1087 states and 1257 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:21:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:21:02,388 INFO L93 Difference]: Finished difference Result 1124 states and 1326 transitions. [2024-10-14 19:21:02,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:21:02,389 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-14 19:21:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:21:02,392 INFO L225 Difference]: With dead ends: 1124 [2024-10-14 19:21:02,392 INFO L226 Difference]: Without dead ends: 1122 [2024-10-14 19:21:02,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:21:02,394 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 25 mSDsluCounter, 18745 mSDsCounter, 0 mSdLazyCounter, 4200 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19561 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:21:02,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19561 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4200 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-14 19:21:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-14 19:21:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1121. [2024-10-14 19:21:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 697 states have (on average 1.8565279770444763) internal successors, (1294), 1114 states have internal predecessors, (1294), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:21:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1303 transitions. [2024-10-14 19:21:02,404 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1303 transitions. Word has length 86 [2024-10-14 19:21:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:21:02,405 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1303 transitions. [2024-10-14 19:21:02,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:21:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1303 transitions. [2024-10-14 19:21:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:21:02,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:21:02,406 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:21:02,421 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-14 19:21:02,609 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-14 19:21:02,609 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:21:02,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:21:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1519425992, now seen corresponding path program 5 times [2024-10-14 19:21:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:21:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537877299] [2024-10-14 19:21:02,610 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:21:02,610 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-14 19:21:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:21:02,613 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-14 19:21:02,614 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-14 19:21:03,751 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:21:03,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:21:03,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:21:03,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:21:03,784 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-14 19:21:03,867 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:21:03,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:21:03,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:21:03,948 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 24 treesize of output 12 [2024-10-14 19:21:04,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:21:04,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:21:04,687 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 33 treesize of output 15 [2024-10-14 19:21:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:21:04,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:21:05,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-10-14 19:21:05,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:21:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537877299] [2024-10-14 19:21:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537877299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:21:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1597468552] [2024-10-14 19:21:05,015 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:21:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:21:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:21:05,019 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:21:05,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-14 19:21:05,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:21:05,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:21:05,542 WARN L253 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 615 conjuncts are in the unsatisfiable core [2024-10-14 19:21:05,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:21:05,572 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-14 19:21:05,577 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 8 treesize of output 1 [2024-10-14 19:21:05,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,604 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,605 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:21:05,669 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:21:05,669 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 12 treesize of output 18 [2024-10-14 19:21:05,693 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-14 19:21:05,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2024-10-14 19:21:05,892 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 8 treesize of output 1 [2024-10-14 19:21:05,899 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:21:06,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:21:06,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:06,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:06,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:21:06,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:21:06,256 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 8 treesize of output 1 [2024-10-14 19:21:23,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989 [2024-10-14 19:21:23,476 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 8 treesize of output 1