./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_JEN_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:09,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:09,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:12:09,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:09,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:09,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:09,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:09,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:09,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:09,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:09,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:09,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:09,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:09,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:09,213 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:09,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:09,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:09,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:09,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:09,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:09,218 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:09,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:09,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:09,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:09,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:09,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:09,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:09,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:09,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:09,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:09,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:12:09,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:12:09,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:09,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:09,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:09,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:09,222 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-clean/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-clean/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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2024-10-11 19:12:09,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:09,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:09,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:09,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:09,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:09,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-11 19:12:10,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:11,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:11,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-11 19:12:11,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b24a93a93/e42fc3ccd452488ea676546c851aa10a/FLAGdfcee6bea [2024-10-11 19:12:11,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b24a93a93/e42fc3ccd452488ea676546c851aa10a [2024-10-11 19:12:11,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:11,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:11,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:11,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:11,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:11,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:11" (1/1) ... [2024-10-11 19:12:11,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd4698a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:11, skipping insertion in model container [2024-10-11 19:12:11,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:11" (1/1) ... [2024-10-11 19:12:11,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:11,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:11,914 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-11 19:12:11,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@266a8f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:11, skipping insertion in model container [2024-10-11 19:12:11,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:11,919 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:12:11,921 INFO L158 Benchmark]: Toolchain (without parser) took 682.93ms. Allocated memory is still 220.2MB. Free memory was 145.4MB in the beginning and 184.5MB in the end (delta: -39.1MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-10-11 19:12:11,924 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:12:11,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.71ms. Allocated memory is still 220.2MB. Free memory was 145.1MB in the beginning and 184.5MB in the end (delta: -39.4MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-10-11 19:12:11,926 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 80.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.71ms. Allocated memory is still 220.2MB. Free memory was 145.1MB in the beginning and 184.5MB in the end (delta: -39.4MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:12:13,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:12:13,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:12:13,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:12:13,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:12:13,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:12:13,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:12:13,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:12:13,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:12:13,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:12:13,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:12:13,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:12:13,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:12:13,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:12:13,937 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:12:13,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:12:13,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:12:13,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:12:13,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:12:13,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:12:13,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:12:13,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:12:13,941 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:12:13,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:12:13,941 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:12:13,941 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:12:13,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:12:13,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:12:13,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:12:13,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:12:13,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:12:13,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:12:13,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:12:13,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:12:13,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:12:13,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:13,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:12:13,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:12:13,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:12:13,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:12:13,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:12:13,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:12:13,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:12:13,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:12:13,946 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:12:13,947 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-clean/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-clean/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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2024-10-11 19:12:14,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:12:14,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:12:14,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:12:14,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:12:14,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:12:14,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-11 19:12:15,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:12:16,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:12:16,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-11 19:12:16,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01fe2878b/2384659d2288446a8d8e38ebf0b628f7/FLAGc59be7b9d [2024-10-11 19:12:16,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/01fe2878b/2384659d2288446a8d8e38ebf0b628f7 [2024-10-11 19:12:16,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:12:16,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:12:16,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:16,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:12:16,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:12:16,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:16" (1/1) ... [2024-10-11 19:12:16,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7b6f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:16, skipping insertion in model container [2024-10-11 19:12:16,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:12:16" (1/1) ... [2024-10-11 19:12:16,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:17,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:17,116 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:12:17,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:12:17,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:17,250 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:12:17,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:12:17,397 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:12:17,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17 WrapperNode [2024-10-11 19:12:17,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:12:17,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:17,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:12:17,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:12:17,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,543 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-10-11 19:12:17,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:12:17,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:12:17,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:12:17,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:12:17,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,689 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 19:12:17,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:12:17,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:12:17,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:12:17,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:12:17,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (1/1) ... [2024-10-11 19:12:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:12:17,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:12:17,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:12:17,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:12:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:12:17,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:12:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:12:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:12:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:12:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:12:17,883 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:12:17,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:12:17,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:12:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:12:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:12:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:12:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:12:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:12:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:12:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:12:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:12:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:12:17,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:12:18,087 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:12:18,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:12:18,118 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:18,153 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:18,173 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:12:22,231 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-10-11 19:12:22,231 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:12:22,346 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:12:22,346 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 19:12:22,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:22 BoogieIcfgContainer [2024-10-11 19:12:22,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:12:22,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:12:22,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:12:22,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:12:22,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:12:16" (1/3) ... [2024-10-11 19:12:22,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb46f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:22, skipping insertion in model container [2024-10-11 19:12:22,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:12:17" (2/3) ... [2024-10-11 19:12:22,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adb46f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:12:22, skipping insertion in model container [2024-10-11 19:12:22,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:12:22" (3/3) ... [2024-10-11 19:12:22,353 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-2.i [2024-10-11 19:12:22,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:12:22,366 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-11 19:12:22,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:12:22,443 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;@ddc59f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:12:22,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-11 19:12:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 1968 states, 933 states have (on average 2.234726688102894) internal successors, (2085), 1961 states have internal predecessors, (2085), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-11 19:12:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:12:22,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:22,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:12:22,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 178352, now seen corresponding path program 1 times [2024-10-11 19:12:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:22,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903451604] [2024-10-11 19:12:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:22,502 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-11 19:12:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:22,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:22,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:22,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:22,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:22,690 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-11 19:12:22,701 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-11 19:12:22,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:22,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903451604] [2024-10-11 19:12:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903451604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:22,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:12:22,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119265844] [2024-10-11 19:12:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:22,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:22,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:22,751 INFO L87 Difference]: Start difference. First operand has 1968 states, 933 states have (on average 2.234726688102894) internal successors, (2085), 1961 states have internal predecessors, (2085), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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-11 19:12:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:25,138 INFO L93 Difference]: Finished difference Result 2118 states and 3185 transitions. [2024-10-11 19:12:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:25,141 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-11 19:12:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:25,176 INFO L225 Difference]: With dead ends: 2118 [2024-10-11 19:12:25,177 INFO L226 Difference]: Without dead ends: 2117 [2024-10-11 19:12:25,178 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-11 19:12:25,181 INFO L432 NwaCegarLoop]: 2523 mSDtfsCounter, 1881 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:25,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 2651 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 19:12:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2024-10-11 19:12:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1953. [2024-10-11 19:12:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 936 states have (on average 2.139957264957265) internal successors, (2003), 1946 states have internal predecessors, (2003), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 19:12:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 3011 transitions. [2024-10-11 19:12:25,430 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 3011 transitions. Word has length 2 [2024-10-11 19:12:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:25,431 INFO L471 AbstractCegarLoop]: Abstraction has 1953 states and 3011 transitions. [2024-10-11 19:12:25,431 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-11 19:12:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 3011 transitions. [2024-10-11 19:12:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:12:25,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:25,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:12:25,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:25,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:25,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:25,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 178353, now seen corresponding path program 1 times [2024-10-11 19:12:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156776936] [2024-10-11 19:12:25,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:25,636 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-11 19:12:25,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:25,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:25,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:25,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:25,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:25,730 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-11 19:12:25,751 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-11 19:12:25,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:25,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156776936] [2024-10-11 19:12:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156776936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:25,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:25,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:12:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411182414] [2024-10-11 19:12:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:25,755 INFO L87 Difference]: Start difference. First operand 1953 states and 3011 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-11 19:12:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:28,543 INFO L93 Difference]: Finished difference Result 3330 states and 5421 transitions. [2024-10-11 19:12:28,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:28,545 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-11 19:12:28,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:28,579 INFO L225 Difference]: With dead ends: 3330 [2024-10-11 19:12:28,579 INFO L226 Difference]: Without dead ends: 3330 [2024-10-11 19:12:28,580 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-11 19:12:28,580 INFO L432 NwaCegarLoop]: 2831 mSDtfsCounter, 1409 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1909 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:28,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1909 Valid, 4814 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 19:12:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2024-10-11 19:12:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3059. [2024-10-11 19:12:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 1543 states have (on average 2.084899546338302) internal successors, (3217), 3052 states have internal predecessors, (3217), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 5225 transitions. [2024-10-11 19:12:28,931 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 5225 transitions. Word has length 2 [2024-10-11 19:12:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 5225 transitions. [2024-10-11 19:12:28,931 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-11 19:12:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 5225 transitions. [2024-10-11 19:12:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:12:28,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:28,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:12:28,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:29,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1503529018, now seen corresponding path program 1 times [2024-10-11 19:12:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:29,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013542151] [2024-10-11 19:12:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:29,138 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-11 19:12:29,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:29,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:29,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:29,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:12:29,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:29,261 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-11 19:12:29,267 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-11 19:12:29,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:12:29,324 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-11 19:12:29,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:12:29,339 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-11 19:12:29,363 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-11 19:12:29,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:29,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013542151] [2024-10-11 19:12:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013542151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:29,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804464863] [2024-10-11 19:12:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:29,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:29,366 INFO L87 Difference]: Start difference. First operand 3059 states and 5225 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-11 19:12:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:32,437 INFO L93 Difference]: Finished difference Result 3212 states and 5386 transitions. [2024-10-11 19:12:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:32,438 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-11 19:12:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:32,449 INFO L225 Difference]: With dead ends: 3212 [2024-10-11 19:12:32,449 INFO L226 Difference]: Without dead ends: 3212 [2024-10-11 19:12:32,449 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-11 19:12:32,450 INFO L432 NwaCegarLoop]: 2264 mSDtfsCounter, 2141 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2644 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:32,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2644 Valid, 2334 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 19:12:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2024-10-11 19:12:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 1941. [2024-10-11 19:12:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 936 states have (on average 2.126068376068376) internal successors, (1990), 1934 states have internal predecessors, (1990), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 19:12:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2998 transitions. [2024-10-11 19:12:32,605 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2998 transitions. Word has length 6 [2024-10-11 19:12:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:32,605 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2998 transitions. [2024-10-11 19:12:32,606 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-11 19:12:32,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2998 transitions. [2024-10-11 19:12:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:12:32,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:32,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:32,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:32,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:32,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash -635240696, now seen corresponding path program 1 times [2024-10-11 19:12:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990328477] [2024-10-11 19:12:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:32,810 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-11 19:12:32,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:32,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:32,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:32,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:32,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:32,967 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-11 19:12:33,021 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-11 19:12:33,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:33,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990328477] [2024-10-11 19:12:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990328477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047357592] [2024-10-11 19:12:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:33,024 INFO L87 Difference]: Start difference. First operand 1941 states and 2998 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-11 19:12:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:35,481 INFO L93 Difference]: Finished difference Result 3199 states and 5285 transitions. [2024-10-11 19:12:35,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:35,482 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-11 19:12:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:35,493 INFO L225 Difference]: With dead ends: 3199 [2024-10-11 19:12:35,493 INFO L226 Difference]: Without dead ends: 3199 [2024-10-11 19:12:35,494 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-11 19:12:35,496 INFO L432 NwaCegarLoop]: 4823 mSDtfsCounter, 1450 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 7169 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:35,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 7169 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:12:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2024-10-11 19:12:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 1958. [2024-10-11 19:12:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 963 states have (on average 2.12668743509865) internal successors, (2048), 1951 states have internal predecessors, (2048), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 19:12:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 3056 transitions. [2024-10-11 19:12:35,700 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 3056 transitions. Word has length 7 [2024-10-11 19:12:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:35,701 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 3056 transitions. [2024-10-11 19:12:35,701 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-11 19:12:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 3056 transitions. [2024-10-11 19:12:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:12:35,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:35,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:35,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:35,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:35,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:35,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash -635240697, now seen corresponding path program 1 times [2024-10-11 19:12:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235949327] [2024-10-11 19:12:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:35,904 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-11 19:12:35,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:35,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:35,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:36,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:36,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:36,035 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-11 19:12:36,048 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-11 19:12:36,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:36,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235949327] [2024-10-11 19:12:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235949327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295470257] [2024-10-11 19:12:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:36,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:36,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:36,050 INFO L87 Difference]: Start difference. First operand 1958 states and 3056 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-11 19:12:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:37,824 INFO L93 Difference]: Finished difference Result 3106 states and 5222 transitions. [2024-10-11 19:12:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:37,827 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-11 19:12:37,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:37,848 INFO L225 Difference]: With dead ends: 3106 [2024-10-11 19:12:37,848 INFO L226 Difference]: Without dead ends: 3106 [2024-10-11 19:12:37,849 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-11 19:12:37,849 INFO L432 NwaCegarLoop]: 4624 mSDtfsCounter, 1671 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 6840 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:37,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 6840 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:12:37,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-10-11 19:12:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1911. [2024-10-11 19:12:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 963 states have (on average 2.0737279335410177) internal successors, (1997), 1904 states have internal predecessors, (1997), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-11 19:12:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 3005 transitions. [2024-10-11 19:12:38,226 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 3005 transitions. Word has length 7 [2024-10-11 19:12:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:38,226 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 3005 transitions. [2024-10-11 19:12:38,226 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-11 19:12:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3005 transitions. [2024-10-11 19:12:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 19:12:38,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:38,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:38,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:38,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:38,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2037912826, now seen corresponding path program 1 times [2024-10-11 19:12:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115091737] [2024-10-11 19:12:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:38,430 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-11 19:12:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:38,435 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:38,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:38,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:38,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:38,626 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-11 19:12:38,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:38,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115091737] [2024-10-11 19:12:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115091737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:38,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:12:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738581256] [2024-10-11 19:12:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:38,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:38,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:38,629 INFO L87 Difference]: Start difference. First operand 1911 states and 3005 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:12:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:39,470 INFO L93 Difference]: Finished difference Result 3306 states and 5456 transitions. [2024-10-11 19:12:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-11 19:12:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:39,483 INFO L225 Difference]: With dead ends: 3306 [2024-10-11 19:12:39,483 INFO L226 Difference]: Without dead ends: 3306 [2024-10-11 19:12:39,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11 19:12:39,484 INFO L432 NwaCegarLoop]: 2877 mSDtfsCounter, 1421 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 5625 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:39,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 5625 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:12:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2024-10-11 19:12:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3055. [2024-10-11 19:12:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 1607 states have (on average 2.031113876789048) internal successors, (3264), 3048 states have internal predecessors, (3264), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 5272 transitions. [2024-10-11 19:12:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 5272 transitions. Word has length 10 [2024-10-11 19:12:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 3055 states and 5272 transitions. [2024-10-11 19:12:39,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:12:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 5272 transitions. [2024-10-11 19:12:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:12:39,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:39,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:39,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:39,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1151902019, now seen corresponding path program 1 times [2024-10-11 19:12:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429678792] [2024-10-11 19:12:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:39,874 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-11 19:12:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:39,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:39,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:40,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:40,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:12:40,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:40,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429678792] [2024-10-11 19:12:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429678792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:40,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742354813] [2024-10-11 19:12:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:40,071 INFO L87 Difference]: Start difference. First operand 3055 states and 5272 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-11 19:12:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:40,628 INFO L93 Difference]: Finished difference Result 3001 states and 5192 transitions. [2024-10-11 19:12:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:40,630 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-11 19:12:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:40,645 INFO L225 Difference]: With dead ends: 3001 [2024-10-11 19:12:40,648 INFO L226 Difference]: Without dead ends: 3001 [2024-10-11 19:12:40,649 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-11 19:12:40,649 INFO L432 NwaCegarLoop]: 2780 mSDtfsCounter, 61 mSDsluCounter, 2738 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5518 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:40,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5518 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:12:40,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2024-10-11 19:12:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 3001. [2024-10-11 19:12:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 1577 states have (on average 2.019023462270133) internal successors, (3184), 2994 states have internal predecessors, (3184), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 5192 transitions. [2024-10-11 19:12:40,854 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 5192 transitions. Word has length 12 [2024-10-11 19:12:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:40,854 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 5192 transitions. [2024-10-11 19:12:40,854 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-11 19:12:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 5192 transitions. [2024-10-11 19:12:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:12:40,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:40,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:40,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:41,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:41,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2088163371, now seen corresponding path program 1 times [2024-10-11 19:12:41,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:41,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788598519] [2024-10-11 19:12:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:41,061 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-11 19:12:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:41,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:41,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:41,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:41,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:41,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:12:41,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:12:41,206 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-11 19:12:41,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:12:41,232 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-11 19:12:41,254 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-11 19:12:41,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:41,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788598519] [2024-10-11 19:12:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788598519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448747997] [2024-10-11 19:12:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:41,256 INFO L87 Difference]: Start difference. First operand 3001 states and 5192 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 19:12:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:43,716 INFO L93 Difference]: Finished difference Result 5733 states and 9927 transitions. [2024-10-11 19:12:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-11 19:12:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:43,740 INFO L225 Difference]: With dead ends: 5733 [2024-10-11 19:12:43,740 INFO L226 Difference]: Without dead ends: 5733 [2024-10-11 19:12:43,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11 19:12:43,741 INFO L432 NwaCegarLoop]: 3033 mSDtfsCounter, 1832 mSDsluCounter, 5307 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 8340 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:43,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 8340 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 19:12:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2024-10-11 19:12:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 3000. [2024-10-11 19:12:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 1576 states have (on average 2.019035532994924) internal successors, (3182), 2993 states have internal predecessors, (3182), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 5190 transitions. [2024-10-11 19:12:44,093 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 5190 transitions. Word has length 13 [2024-10-11 19:12:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:44,094 INFO L471 AbstractCegarLoop]: Abstraction has 3000 states and 5190 transitions. [2024-10-11 19:12:44,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 19:12:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 5190 transitions. [2024-10-11 19:12:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:12:44,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:44,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:44,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 19:12:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:44,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1245060802, now seen corresponding path program 1 times [2024-10-11 19:12:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969262936] [2024-10-11 19:12:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:44,297 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-11 19:12:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:44,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:44,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:44,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:12:44,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:44,432 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-11 19:12:44,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:44,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969262936] [2024-10-11 19:12:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969262936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:44,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183230976] [2024-10-11 19:12:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:12:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:12:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:12:44,434 INFO L87 Difference]: Start difference. First operand 3000 states and 5190 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-11 19:12:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:45,007 INFO L93 Difference]: Finished difference Result 2946 states and 5110 transitions. [2024-10-11 19:12:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:12:45,013 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-11 19:12:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:45,020 INFO L225 Difference]: With dead ends: 2946 [2024-10-11 19:12:45,020 INFO L226 Difference]: Without dead ends: 2946 [2024-10-11 19:12:45,021 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-11 19:12:45,021 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 61 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5444 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:45,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5444 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:12:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2024-10-11 19:12:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2946. [2024-10-11 19:12:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 1546 states have (on average 2.0064683053040104) internal successors, (3102), 2939 states have internal predecessors, (3102), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 5110 transitions. [2024-10-11 19:12:45,198 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 5110 transitions. Word has length 15 [2024-10-11 19:12:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:45,198 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 5110 transitions. [2024-10-11 19:12:45,198 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-11 19:12:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 5110 transitions. [2024-10-11 19:12:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:12:45,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:45,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:12:45,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:45,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:45,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:45,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1792442104, now seen corresponding path program 1 times [2024-10-11 19:12:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547905438] [2024-10-11 19:12:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:45,400 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-11 19:12:45,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:45,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:45,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:45,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:45,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:45,579 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-11 19:12:45,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:45,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547905438] [2024-10-11 19:12:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547905438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:45,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:45,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:45,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623472512] [2024-10-11 19:12:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:45,581 INFO L87 Difference]: Start difference. First operand 2946 states and 5110 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-11 19:12:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:46,274 INFO L93 Difference]: Finished difference Result 2930 states and 5066 transitions. [2024-10-11 19:12:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:12:46,276 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-11 19:12:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:46,281 INFO L225 Difference]: With dead ends: 2930 [2024-10-11 19:12:46,282 INFO L226 Difference]: Without dead ends: 2930 [2024-10-11 19:12:46,282 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-11 19:12:46,282 INFO L432 NwaCegarLoop]: 2712 mSDtfsCounter, 45 mSDsluCounter, 5406 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8118 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:46,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8118 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:12:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2024-10-11 19:12:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2024-10-11 19:12:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 1544 states have (on average 1.9805699481865284) internal successors, (3058), 2923 states have internal predecessors, (3058), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 5066 transitions. [2024-10-11 19:12:46,441 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 5066 transitions. Word has length 17 [2024-10-11 19:12:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:46,441 INFO L471 AbstractCegarLoop]: Abstraction has 2930 states and 5066 transitions. [2024-10-11 19:12:46,441 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-11 19:12:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 5066 transitions. [2024-10-11 19:12:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:12:46,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:46,442 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-11 19:12:46,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:46,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1517417210, now seen corresponding path program 1 times [2024-10-11 19:12:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403979388] [2024-10-11 19:12:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:46,644 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-11 19:12:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:46,646 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:46,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:46,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:12:46,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:46,808 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-11 19:12:46,860 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-11 19:12:46,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:46,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:46,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403979388] [2024-10-11 19:12:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403979388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977624515] [2024-10-11 19:12:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:46,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:46,861 INFO L87 Difference]: Start difference. First operand 2930 states and 5066 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-11 19:12:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:50,113 INFO L93 Difference]: Finished difference Result 2934 states and 5066 transitions. [2024-10-11 19:12:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:50,114 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-11 19:12:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:50,119 INFO L225 Difference]: With dead ends: 2934 [2024-10-11 19:12:50,119 INFO L226 Difference]: Without dead ends: 2934 [2024-10-11 19:12:50,119 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-11 19:12:50,120 INFO L432 NwaCegarLoop]: 2469 mSDtfsCounter, 1573 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:50,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 3906 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 19:12:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2024-10-11 19:12:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2926. [2024-10-11 19:12:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 1544 states have (on average 1.9753886010362693) internal successors, (3050), 2919 states have internal predecessors, (3050), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 5058 transitions. [2024-10-11 19:12:50,273 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 5058 transitions. Word has length 31 [2024-10-11 19:12:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:50,273 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 5058 transitions. [2024-10-11 19:12:50,273 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-11 19:12:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 5058 transitions. [2024-10-11 19:12:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:12:50,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:50,275 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-11 19:12:50,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:50,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:50,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1517417209, now seen corresponding path program 1 times [2024-10-11 19:12:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668123142] [2024-10-11 19:12:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:50,477 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-11 19:12:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:50,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:50,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:50,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:12:50,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:50,620 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-11 19:12:50,749 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-11 19:12:50,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:50,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668123142] [2024-10-11 19:12:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668123142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:50,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675263535] [2024-10-11 19:12:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:50,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:50,751 INFO L87 Difference]: Start difference. First operand 2926 states and 5058 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-11 19:12:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:54,285 INFO L93 Difference]: Finished difference Result 5189 states and 9343 transitions. [2024-10-11 19:12:54,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:54,286 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-11 19:12:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:54,299 INFO L225 Difference]: With dead ends: 5189 [2024-10-11 19:12:54,299 INFO L226 Difference]: Without dead ends: 5189 [2024-10-11 19:12:54,299 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-11 19:12:54,300 INFO L432 NwaCegarLoop]: 4748 mSDtfsCounter, 1348 mSDsluCounter, 5742 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 10490 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:54,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 10490 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 19:12:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2024-10-11 19:12:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 2922. [2024-10-11 19:12:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 1544 states have (on average 1.9702072538860103) internal successors, (3042), 2915 states have internal predecessors, (3042), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 5050 transitions. [2024-10-11 19:12:54,622 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 5050 transitions. Word has length 31 [2024-10-11 19:12:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 2922 states and 5050 transitions. [2024-10-11 19:12:54,623 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-11 19:12:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 5050 transitions. [2024-10-11 19:12:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 19:12:54,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:54,627 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-11 19:12:54,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:54,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:54,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:54,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -453349758, now seen corresponding path program 1 times [2024-10-11 19:12:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364550077] [2024-10-11 19:12:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:54,829 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-11 19:12:54,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:54,830 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:54,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:55,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:12:55,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:55,061 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-11 19:12:55,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:55,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364550077] [2024-10-11 19:12:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364550077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:12:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002141059] [2024-10-11 19:12:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:55,065 INFO L87 Difference]: Start difference. First operand 2922 states and 5050 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-11 19:12:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:55,727 INFO L93 Difference]: Finished difference Result 2910 states and 5030 transitions. [2024-10-11 19:12:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:12:55,729 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-11 19:12:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:55,734 INFO L225 Difference]: With dead ends: 2910 [2024-10-11 19:12:55,734 INFO L226 Difference]: Without dead ends: 2910 [2024-10-11 19:12:55,735 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-11 19:12:55,736 INFO L432 NwaCegarLoop]: 2706 mSDtfsCounter, 15 mSDsluCounter, 5395 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:55,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8101 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:12:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2024-10-11 19:12:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2024-10-11 19:12:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 1532 states have (on average 1.9725848563968669) internal successors, (3022), 2903 states have internal predecessors, (3022), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 5030 transitions. [2024-10-11 19:12:55,989 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 5030 transitions. Word has length 50 [2024-10-11 19:12:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:55,989 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 5030 transitions. [2024-10-11 19:12:55,990 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-11 19:12:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 5030 transitions. [2024-10-11 19:12:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:12:55,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:55,991 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-11 19:12:55,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 19:12:56,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:56,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:56,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:56,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1977955968, now seen corresponding path program 1 times [2024-10-11 19:12:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:56,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714328536] [2024-10-11 19:12:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:56,196 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-11 19:12:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:56,198 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:56,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:12:56,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:56,483 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-11 19:12:56,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-11 19:12:56,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:12:56,851 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-11 19:12:56,862 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:12:56,862 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-11 19:12:56,870 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-11 19:12:56,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:12:56,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:12:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714328536] [2024-10-11 19:12:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714328536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:12:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:12:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:12:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907858591] [2024-10-11 19:12:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:12:56,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:12:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:12:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:12:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:12:56,871 INFO L87 Difference]: Start difference. First operand 2910 states and 5030 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-11 19:12:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:12:59,352 INFO L93 Difference]: Finished difference Result 2872 states and 4992 transitions. [2024-10-11 19:12:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:12:59,352 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-11 19:12:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:12:59,364 INFO L225 Difference]: With dead ends: 2872 [2024-10-11 19:12:59,364 INFO L226 Difference]: Without dead ends: 2872 [2024-10-11 19:12:59,364 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-11 19:12:59,368 INFO L432 NwaCegarLoop]: 2348 mSDtfsCounter, 3012 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3515 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:12:59,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3515 Valid, 2446 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:12:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2024-10-11 19:12:59,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2845. [2024-10-11 19:12:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 1505 states have (on average 1.9401993355481728) internal successors, (2920), 2838 states have internal predecessors, (2920), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:12:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4928 transitions. [2024-10-11 19:12:59,555 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4928 transitions. Word has length 54 [2024-10-11 19:12:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:12:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4928 transitions. [2024-10-11 19:12:59,556 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-11 19:12:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4928 transitions. [2024-10-11 19:12:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:12:59,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:12:59,558 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-11 19:12:59,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:59,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:12:59,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:12:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash 637906481, now seen corresponding path program 1 times [2024-10-11 19:12:59,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:12:59,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550972749] [2024-10-11 19:12:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:12:59,760 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-11 19:12:59,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:12:59,762 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:59,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:12:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:12:59,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:12:59,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:12:59,981 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-11 19:12:59,992 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-11 19:13:00,008 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-11 19:13:00,017 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-11 19:13:00,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:00,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550972749] [2024-10-11 19:13:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550972749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510063962] [2024-10-11 19:13:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:13:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:00,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:13:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:00,019 INFO L87 Difference]: Start difference. First operand 2845 states and 4928 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-11 19:13:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:01,821 INFO L93 Difference]: Finished difference Result 2844 states and 4927 transitions. [2024-10-11 19:13:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:13:01,821 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-11 19:13:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:01,828 INFO L225 Difference]: With dead ends: 2844 [2024-10-11 19:13:01,828 INFO L226 Difference]: Without dead ends: 2844 [2024-10-11 19:13:01,829 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-11 19:13:01,829 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 2 mSDsluCounter, 7105 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9785 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:01,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 9785 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:13:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-10-11 19:13:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2844. [2024-10-11 19:13:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 1505 states have (on average 1.9395348837209303) internal successors, (2919), 2837 states have internal predecessors, (2919), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:13:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4927 transitions. [2024-10-11 19:13:02,015 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4927 transitions. Word has length 58 [2024-10-11 19:13:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 4927 transitions. [2024-10-11 19:13:02,016 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-11 19:13:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4927 transitions. [2024-10-11 19:13:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:13:02,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:02,017 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-11 19:13:02,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:02,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:02,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:02,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 637906482, now seen corresponding path program 1 times [2024-10-11 19:13:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464220804] [2024-10-11 19:13:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:02,220 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-11 19:13:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:02,222 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:02,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:02,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:13:02,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:02,453 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-11 19:13:02,468 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-11 19:13:02,473 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-11 19:13:02,502 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-11 19:13:02,515 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-11 19:13:02,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:02,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464220804] [2024-10-11 19:13:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464220804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:02,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363005932] [2024-10-11 19:13:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:02,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:13:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:13:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:13:02,517 INFO L87 Difference]: Start difference. First operand 2844 states and 4927 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-11 19:13:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:04,464 INFO L93 Difference]: Finished difference Result 2843 states and 4926 transitions. [2024-10-11 19:13:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:13:04,465 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-11 19:13:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:04,478 INFO L225 Difference]: With dead ends: 2843 [2024-10-11 19:13:04,479 INFO L226 Difference]: Without dead ends: 2843 [2024-10-11 19:13:04,479 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-11 19:13:04,479 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 1 mSDsluCounter, 7136 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 9816 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:04,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 9816 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:13:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2024-10-11 19:13:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2024-10-11 19:13:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 1504 states have (on average 1.940159574468085) internal successors, (2918), 2836 states have internal predecessors, (2918), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-11 19:13:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 4926 transitions. [2024-10-11 19:13:04,735 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 4926 transitions. Word has length 58 [2024-10-11 19:13:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:04,736 INFO L471 AbstractCegarLoop]: Abstraction has 2843 states and 4926 transitions. [2024-10-11 19:13:04,736 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-11 19:13:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 4926 transitions. [2024-10-11 19:13:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:13:04,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:04,737 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-11 19:13:04,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:13:04,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:04,942 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1941799563, now seen corresponding path program 1 times [2024-10-11 19:13:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222218268] [2024-10-11 19:13:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:04,943 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-11 19:13:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:04,946 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:04,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:05,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:13:05,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:05,196 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-11 19:13:05,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:13:05,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:05,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222218268] [2024-10-11 19:13:05,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222218268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:13:05,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:13:05,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:13:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099075563] [2024-10-11 19:13:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:13:05,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:13:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:05,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:13:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:13:05,199 INFO L87 Difference]: Start difference. First operand 2843 states and 4926 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-11 19:13:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:05,825 INFO L93 Difference]: Finished difference Result 2845 states and 4929 transitions. [2024-10-11 19:13:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:13:05,827 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-11 19:13:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:05,836 INFO L225 Difference]: With dead ends: 2845 [2024-10-11 19:13:05,837 INFO L226 Difference]: Without dead ends: 2845 [2024-10-11 19:13:05,837 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-11 19:13:05,837 INFO L432 NwaCegarLoop]: 2680 mSDtfsCounter, 0 mSDsluCounter, 5357 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8037 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:05,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8037 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:13:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2024-10-11 19:13:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2845. [2024-10-11 19:13:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 1505 states have (on average 1.9401993355481728) internal successors, (2920), 2838 states have internal predecessors, (2920), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-11 19:13:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4929 transitions. [2024-10-11 19:13:06,003 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4929 transitions. Word has length 64 [2024-10-11 19:13:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4929 transitions. [2024-10-11 19:13:06,004 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-11 19:13:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4929 transitions. [2024-10-11 19:13:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:13:06,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:06,005 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-11 19:13:06,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:06,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:06,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash 989533173, now seen corresponding path program 1 times [2024-10-11 19:13:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099935997] [2024-10-11 19:13:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:13:06,210 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-11 19:13:06,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:06,213 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:06,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:13:06,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:13:06,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:06,465 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-11 19:13:06,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:06,507 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-11 19:13:06,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099935997] [2024-10-11 19:13:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099935997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:06,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:13:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688932382] [2024-10-11 19:13:06,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:06,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:13:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:06,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:13:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:13:06,513 INFO L87 Difference]: Start difference. First operand 2845 states and 4929 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-11 19:13:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:07,395 INFO L93 Difference]: Finished difference Result 2854 states and 4943 transitions. [2024-10-11 19:13:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:13:07,405 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-11 19:13:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:07,420 INFO L225 Difference]: With dead ends: 2854 [2024-10-11 19:13:07,420 INFO L226 Difference]: Without dead ends: 2854 [2024-10-11 19:13:07,420 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-11 19:13:07,421 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 4 mSDsluCounter, 8032 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10711 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:07,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10711 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 19:13:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-10-11 19:13:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2853. [2024-10-11 19:13:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1512 states have (on average 1.9398148148148149) internal successors, (2933), 2845 states have internal predecessors, (2933), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-11 19:13:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4942 transitions. [2024-10-11 19:13:07,621 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4942 transitions. Word has length 65 [2024-10-11 19:13:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4942 transitions. [2024-10-11 19:13:07,621 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-11 19:13:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4942 transitions. [2024-10-11 19:13:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:13:07,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:07,622 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-11 19:13:07,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:07,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1057743499, now seen corresponding path program 2 times [2024-10-11 19:13:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397575936] [2024-10-11 19:13:07,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:13:07,828 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-11 19:13:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:07,833 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:07,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:08,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:13:08,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:08,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:13:08,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:08,287 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-11 19:13:08,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:08,415 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-11 19:13:08,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397575936] [2024-10-11 19:13:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397575936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:08,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:13:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058716895] [2024-10-11 19:13:08,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:13:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:13:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:13:08,418 INFO L87 Difference]: Start difference. First operand 2853 states and 4942 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-11 19:13:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:10,027 INFO L93 Difference]: Finished difference Result 2865 states and 4961 transitions. [2024-10-11 19:13:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:13:10,028 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-11 19:13:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:10,035 INFO L225 Difference]: With dead ends: 2865 [2024-10-11 19:13:10,035 INFO L226 Difference]: Without dead ends: 2863 [2024-10-11 19:13:10,035 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-11 19:13:10,036 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 8 mSDsluCounter, 18744 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21423 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:10,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21423 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 19:13:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2024-10-11 19:13:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2862. [2024-10-11 19:13:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 1521 states have (on average 1.9362261669953977) internal successors, (2945), 2854 states have internal predecessors, (2945), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-11 19:13:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4954 transitions. [2024-10-11 19:13:10,248 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4954 transitions. Word has length 68 [2024-10-11 19:13:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 4954 transitions. [2024-10-11 19:13:10,248 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-11 19:13:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4954 transitions. [2024-10-11 19:13:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:13:10,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:10,249 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-11 19:13:10,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:13:10,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:10,450 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1125682549, now seen corresponding path program 3 times [2024-10-11 19:13:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769499804] [2024-10-11 19:13:10,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:13:10,451 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-11 19:13:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:10,454 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:10,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:11,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:13:11,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:11,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:13:11,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:11,147 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-11 19:13:11,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:11,564 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-11 19:13:11,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:11,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769499804] [2024-10-11 19:13:11,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769499804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:11,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:13:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867581898] [2024-10-11 19:13:11,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:11,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:13:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:13:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:13:11,566 INFO L87 Difference]: Start difference. First operand 2862 states and 4954 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-11 19:13:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:15,175 INFO L93 Difference]: Finished difference Result 2883 states and 4990 transitions. [2024-10-11 19:13:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:13:15,175 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-11 19:13:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:15,182 INFO L225 Difference]: With dead ends: 2883 [2024-10-11 19:13:15,182 INFO L226 Difference]: Without dead ends: 2880 [2024-10-11 19:13:15,182 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-11 19:13:15,183 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 14 mSDsluCounter, 34810 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37489 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:15,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37489 Invalid, 1844 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 19:13:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2024-10-11 19:13:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2024-10-11 19:13:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 1539 states have (on average 1.9285250162443144) internal successors, (2968), 2872 states have internal predecessors, (2968), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-11 19:13:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4977 transitions. [2024-10-11 19:13:15,387 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4977 transitions. Word has length 74 [2024-10-11 19:13:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:15,387 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4977 transitions. [2024-10-11 19:13:15,388 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-11 19:13:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4977 transitions. [2024-10-11 19:13:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:13:15,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:15,388 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-11 19:13:15,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:15,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:15,593 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash 321219957, now seen corresponding path program 4 times [2024-10-11 19:13:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582384900] [2024-10-11 19:13:15,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:13:15,594 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-11 19:13:15,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:15,597 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:16,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:13:16,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:16,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:13:16,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:16,373 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-11 19:13:16,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:17,529 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-11 19:13:17,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582384900] [2024-10-11 19:13:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582384900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:13:17,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:13:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:13:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222054627] [2024-10-11 19:13:17,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:13:17,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:13:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:13:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:13:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:13:17,532 INFO L87 Difference]: Start difference. First operand 2880 states and 4977 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-11 19:13:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:13:25,511 INFO L93 Difference]: Finished difference Result 2917 states and 5046 transitions. [2024-10-11 19:13:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:13:25,513 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-11 19:13:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:13:25,524 INFO L225 Difference]: With dead ends: 2917 [2024-10-11 19:13:25,526 INFO L226 Difference]: Without dead ends: 2915 [2024-10-11 19:13:25,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:13:25,531 INFO L432 NwaCegarLoop]: 2679 mSDtfsCounter, 26 mSDsluCounter, 61594 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 64273 SdHoareTripleChecker+Invalid, 4134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:13:25,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 64273 Invalid, 4134 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 19:13:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2024-10-11 19:13:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2914. [2024-10-11 19:13:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 1573 states have (on average 1.916083916083916) internal successors, (3014), 2906 states have internal predecessors, (3014), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-11 19:13:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5023 transitions. [2024-10-11 19:13:25,724 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5023 transitions. Word has length 86 [2024-10-11 19:13:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:13:25,724 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5023 transitions. [2024-10-11 19:13:25,725 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-11 19:13:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5023 transitions. [2024-10-11 19:13:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:13:25,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:13:25,725 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-11 19:13:25,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:25,930 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-11 19:13:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:13:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -466330251, now seen corresponding path program 5 times [2024-10-11 19:13:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:13:25,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013858644] [2024-10-11 19:13:25,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:13:25,932 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-11 19:13:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:13:25,933 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:25,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:13:27,045 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:13:27,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:13:27,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:13:27,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:13:27,083 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-11 19:13:27,164 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:13:27,165 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-11 19:13:27,185 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-11 19:13:27,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 19:13:27,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:13:27,906 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-11 19:13:27,939 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-11 19:13:27,959 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-11 19:13:27,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:13:28,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1994) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-11 19:13:28,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:13:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013858644] [2024-10-11 19:13:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013858644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:13:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1061997776] [2024-10-11 19:13:28,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:13:28,245 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:13:28,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:13:28,248 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:13:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process