./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_FNV_nondet_test3-1.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_FNV_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:05:05,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:05:05,398 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:05:05,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:05:05,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:05:05,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:05:05,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:05:05,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:05:05,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:05:05,436 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:05:05,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:05:05,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:05:05,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:05:05,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:05:05,437 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:05:05,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:05:05,440 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:05:05,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:05:05,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:05:05,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:05:05,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:05:05,444 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:05:05,444 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:05:05,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:05:05,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:05:05,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:05:05,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:05:05,445 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:05:05,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:05:05,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:05:05,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:05:05,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:05:05,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:05:05,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:05:05,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:05:05,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:05:05,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:05:05,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:05:05,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:05:05,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:05:05,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:05:05,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:05:05,452 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-11 19:05:05,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:05:05,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:05:05,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:05:05,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:05:05,734 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:05:05,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 19:05:07,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:05:07,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:05:07,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 19:05:07,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0a3287ae/21ef2ee69b6e44cf87de18a242d93612/FLAG007788a01 [2024-10-11 19:05:07,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d0a3287ae/21ef2ee69b6e44cf87de18a242d93612 [2024-10-11 19:05:07,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:05:07,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:05:07,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:05:07,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:05:07,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:05:07,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:07" (1/1) ... [2024-10-11 19:05:07,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29bfd48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:07, skipping insertion in model container [2024-10-11 19:05:07,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:07" (1/1) ... [2024-10-11 19:05:07,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:05:07,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:05:07,974 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:05:07,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29f8074b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:07, skipping insertion in model container [2024-10-11 19:05:07,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:05:07,976 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:05:07,977 INFO L158 Benchmark]: Toolchain (without parser) took 560.22ms. Allocated memory is still 165.7MB. Free memory was 96.1MB in the beginning and 130.0MB in the end (delta: -34.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 19:05:07,977 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:05:07,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.22ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 130.0MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 19:05:07,979 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.15ms. Allocated memory is still 104.9MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.22ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 130.0MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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_FNV_nondet_test3-1.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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:05:09,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:05:09,952 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:05:09,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:05:09,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:05:09,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:05:09,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:05:09,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:05:09,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:05:09,989 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:05:09,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:05:09,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:05:09,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:05:09,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:05:09,991 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:05:09,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:05:09,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:05:09,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:05:09,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:05:09,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:05:09,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:05:09,996 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:05:09,996 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:05:09,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:05:09,996 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:05:09,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:05:09,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:05:09,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:05:09,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:05:09,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:05:09,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:05:09,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:05:09,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:05:09,999 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:05:09,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:05:09,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:05:10,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:05:10,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:05:10,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:05:10,002 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:05:10,002 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-11 19:05:10,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:05:10,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:05:10,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:05:10,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:05:10,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:05:10,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 19:05:11,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:05:11,987 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:05:11,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-10-11 19:05:12,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e92471265/654c2e9043b64a08b00d4ce6aab3891a/FLAG3b7c02c1c [2024-10-11 19:05:12,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e92471265/654c2e9043b64a08b00d4ce6aab3891a [2024-10-11 19:05:12,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:05:12,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:05:12,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:05:12,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:05:12,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:05:12,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7894d036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12, skipping insertion in model container [2024-10-11 19:05:12,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:05:12,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:05:12,554 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:05:12,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:05:12,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:05:12,651 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:05:12,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:05:12,770 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:05:12,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12 WrapperNode [2024-10-11 19:05:12,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:05:12,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:05:12,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:05:12,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:05:12,779 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:05:12" (1/1) ... [2024-10-11 19:05:12,815 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:05:12" (1/1) ... [2024-10-11 19:05:12,863 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1050 [2024-10-11 19:05:12,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:05:12,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:05:12,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:05:12,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:05:12,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,945 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 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:05:12,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:12,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:13,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:13,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:13,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:13,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:05:13,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:05:13,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:05:13,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:05:13,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (1/1) ... [2024-10-11 19:05:13,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:05:13,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:05:13,062 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:05:13,065 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:05:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:05:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:05:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:05:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:05:13,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:05:13,104 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:05:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:05:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:05:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:05:13,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:05:13,288 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:05:13,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:05:13,294 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:05:13,335 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:05:13,356 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:05:16,429 INFO L? ?]: Removed 1080 outVars from TransFormulas that were not future-live. [2024-10-11 19:05:16,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:05:16,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:05:16,554 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 19:05:16,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:16 BoogieIcfgContainer [2024-10-11 19:05:16,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:05:16,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:05:16,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:05:16,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:05:16,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:05:12" (1/3) ... [2024-10-11 19:05:16,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67163d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:16, skipping insertion in model container [2024-10-11 19:05:16,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:05:12" (2/3) ... [2024-10-11 19:05:16,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67163d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:05:16, skipping insertion in model container [2024-10-11 19:05:16,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:05:16" (3/3) ... [2024-10-11 19:05:16,562 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2024-10-11 19:05:16,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:05:16,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-10-11 19:05:16,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:05:16,644 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;@6c9b2e10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:05:16,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-10-11 19:05:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 958 states, 428 states have (on average 2.5116822429906542) internal successors, (1075), 951 states have internal predecessors, (1075), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:05:16,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:16,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:05:16,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1666147, now seen corresponding path program 1 times [2024-10-11 19:05:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266482097] [2024-10-11 19:05:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:16,672 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:05:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:16,674 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:05:16,675 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:05:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:16,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:05:16,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:16,875 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-11 19:05:16,876 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:05:16,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:16,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266482097] [2024-10-11 19:05:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266482097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409435676] [2024-10-11 19:05:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:05:16,928 INFO L87 Difference]: Start difference. First operand has 958 states, 428 states have (on average 2.5116822429906542) internal successors, (1075), 951 states have internal predecessors, (1075), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:05:18,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:18,927 INFO L93 Difference]: Finished difference Result 1309 states and 1412 transitions. [2024-10-11 19:05:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-10-11 19:05:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:18,944 INFO L225 Difference]: With dead ends: 1309 [2024-10-11 19:05:18,944 INFO L226 Difference]: Without dead ends: 1307 [2024-10-11 19:05:18,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:05:18,948 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 387 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1413 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:18,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1218 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 1413 Unchecked, 1.9s Time] [2024-10-11 19:05:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-10-11 19:05:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 947. [2024-10-11 19:05:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 423 states have (on average 2.3498817966903074) internal successors, (994), 940 states have internal predecessors, (994), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1004 transitions. [2024-10-11 19:05:19,020 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1004 transitions. Word has length 3 [2024-10-11 19:05:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:19,021 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1004 transitions. [2024-10-11 19:05:19,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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:05:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1004 transitions. [2024-10-11 19:05:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:05:19,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:19,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:05:19,027 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:19,222 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:05:19,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1664581, now seen corresponding path program 1 times [2024-10-11 19:05:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:19,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436559701] [2024-10-11 19:05:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:19,224 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:05:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:19,227 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:05:19,228 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:05:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:19,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:19,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:19,342 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:05:19,355 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:05:19,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:19,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436559701] [2024-10-11 19:05:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436559701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:05:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682760990] [2024-10-11 19:05:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:19,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:19,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:19,361 INFO L87 Difference]: Start difference. First operand 947 states and 1004 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:05:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:20,490 INFO L93 Difference]: Finished difference Result 954 states and 1013 transitions. [2024-10-11 19:05:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 19:05:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:20,493 INFO L225 Difference]: With dead ends: 954 [2024-10-11 19:05:20,493 INFO L226 Difference]: Without dead ends: 954 [2024-10-11 19:05:20,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:05:20,494 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 874 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:20,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 573 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:05:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-11 19:05:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 946. [2024-10-11 19:05:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 432 states have (on average 2.303240740740741) internal successors, (995), 938 states have internal predecessors, (995), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1005 transitions. [2024-10-11 19:05:20,516 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1005 transitions. Word has length 3 [2024-10-11 19:05:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:20,516 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1005 transitions. [2024-10-11 19:05:20,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:05:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1005 transitions. [2024-10-11 19:05:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 19:05:20,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:20,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 19:05:20,520 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 (3)] Ended with exit code 0 [2024-10-11 19:05:20,718 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:05:20,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1664582, now seen corresponding path program 1 times [2024-10-11 19:05:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101759921] [2024-10-11 19:05:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:20,720 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:05:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:20,722 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:05:20,723 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:05:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:20,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:05:20,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:20,799 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:05:20,812 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:05:20,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:20,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101759921] [2024-10-11 19:05:20,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101759921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:20,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:20,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:05:20,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167131899] [2024-10-11 19:05:20,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:20,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:20,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:20,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:20,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:20,815 INFO L87 Difference]: Start difference. First operand 946 states and 1005 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:05:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:22,681 INFO L93 Difference]: Finished difference Result 1315 states and 1408 transitions. [2024-10-11 19:05:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 19:05:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:22,684 INFO L225 Difference]: With dead ends: 1315 [2024-10-11 19:05:22,685 INFO L226 Difference]: Without dead ends: 1315 [2024-10-11 19:05:22,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:05:22,688 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 397 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:22,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1217 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:05:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-11 19:05:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1121. [2024-10-11 19:05:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 607 states have (on average 2.2784184514003294) internal successors, (1383), 1112 states have internal predecessors, (1383), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1395 transitions. [2024-10-11 19:05:22,706 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1395 transitions. Word has length 3 [2024-10-11 19:05:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:22,707 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1395 transitions. [2024-10-11 19:05:22,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:05:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1395 transitions. [2024-10-11 19:05:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:05:22,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:22,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:22,711 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:22,912 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:05:22,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -322436529, now seen corresponding path program 1 times [2024-10-11 19:05:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284876178] [2024-10-11 19:05:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:22,913 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:05:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:22,916 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:05:22,917 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:05:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:23,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:05:23,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:23,022 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:05:23,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 5 [2024-10-11 19:05:23,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:05:23,100 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:05:23,114 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:05:23,115 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:05:23,136 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:05:23,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:23,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:23,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284876178] [2024-10-11 19:05:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284876178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253373300] [2024-10-11 19:05:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:23,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:23,152 INFO L87 Difference]: Start difference. First operand 1121 states and 1395 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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:05:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:25,009 INFO L93 Difference]: Finished difference Result 1123 states and 1398 transitions. [2024-10-11 19:05:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:25,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:05:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:25,013 INFO L225 Difference]: With dead ends: 1123 [2024-10-11 19:05:25,013 INFO L226 Difference]: Without dead ends: 1123 [2024-10-11 19:05:25,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:05:25,015 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 964 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:25,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 300 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:05:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2024-10-11 19:05:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 934. [2024-10-11 19:05:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 432 states have (on average 2.2708333333333335) internal successors, (981), 926 states have internal predecessors, (981), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 991 transitions. [2024-10-11 19:05:25,034 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 991 transitions. Word has length 7 [2024-10-11 19:05:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:25,034 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 991 transitions. [2024-10-11 19:05:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:05:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 991 transitions. [2024-10-11 19:05:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 19:05:25,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:25,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:25,045 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 (5)] Ended with exit code 0 [2024-10-11 19:05:25,238 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:05:25,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:25,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1405597810, now seen corresponding path program 1 times [2024-10-11 19:05:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829435010] [2024-10-11 19:05:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:25,240 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:05:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:25,244 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:05:25,245 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:05:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:25,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:25,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:25,344 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:05:25,352 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:05:25,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:25,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829435010] [2024-10-11 19:05:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829435010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242689343] [2024-10-11 19:05:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:25,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:25,370 INFO L87 Difference]: Start difference. First operand 934 states and 991 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:05:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:26,674 INFO L93 Difference]: Finished difference Result 1236 states and 1324 transitions. [2024-10-11 19:05:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 19:05:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:26,679 INFO L225 Difference]: With dead ends: 1236 [2024-10-11 19:05:26,679 INFO L226 Difference]: Without dead ends: 1236 [2024-10-11 19:05:26,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:05:26,680 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 833 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:26,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 990 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:05:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-11 19:05:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 886. [2024-10-11 19:05:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 432 states have (on average 2.1597222222222223) internal successors, (933), 878 states have internal predecessors, (933), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 943 transitions. [2024-10-11 19:05:26,698 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 943 transitions. Word has length 8 [2024-10-11 19:05:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:26,699 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 943 transitions. [2024-10-11 19:05:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:05:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 943 transitions. [2024-10-11 19:05:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 19:05:26,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:26,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:26,704 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:26,900 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:05:26,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1405597809, now seen corresponding path program 1 times [2024-10-11 19:05:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529664757] [2024-10-11 19:05:26,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:26,902 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:05:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:26,903 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:05:26,903 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:05:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:26,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:05:26,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:27,006 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:05:27,033 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:05:27,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:27,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529664757] [2024-10-11 19:05:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529664757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057008820] [2024-10-11 19:05:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:27,034 INFO L87 Difference]: Start difference. First operand 886 states and 943 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:05:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:28,938 INFO L93 Difference]: Finished difference Result 1310 states and 1401 transitions. [2024-10-11 19:05:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 19:05:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:28,942 INFO L225 Difference]: With dead ends: 1310 [2024-10-11 19:05:28,942 INFO L226 Difference]: Without dead ends: 1310 [2024-10-11 19:05:28,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:05:28,944 INFO L432 NwaCegarLoop]: 942 mSDtfsCounter, 623 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:28,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1290 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:05:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-10-11 19:05:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 903. [2024-10-11 19:05:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 459 states have (on average 2.150326797385621) internal successors, (987), 895 states have internal predecessors, (987), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 19:05:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 997 transitions. [2024-10-11 19:05:28,958 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 997 transitions. Word has length 8 [2024-10-11 19:05:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 997 transitions. [2024-10-11 19:05:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:05:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 997 transitions. [2024-10-11 19:05:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 19:05:28,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:28,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:28,966 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 (7)] Ended with exit code 0 [2024-10-11 19:05:29,159 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:05:29,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:29,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 555831039, now seen corresponding path program 1 times [2024-10-11 19:05:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:29,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488349643] [2024-10-11 19:05:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:29,161 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:05:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:29,163 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:05:29,165 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:05:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:29,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:05:29,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:29,302 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:05:29,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:29,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:29,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488349643] [2024-10-11 19:05:29,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488349643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:29,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:29,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443642785] [2024-10-11 19:05:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:29,304 INFO L87 Difference]: Start difference. First operand 903 states and 997 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:05:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:30,431 INFO L93 Difference]: Finished difference Result 1283 states and 1433 transitions. [2024-10-11 19:05:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-10-11 19:05:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:30,435 INFO L225 Difference]: With dead ends: 1283 [2024-10-11 19:05:30,436 INFO L226 Difference]: Without dead ends: 1283 [2024-10-11 19:05:30,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:30,437 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 403 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:30,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2399 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:05:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-10-11 19:05:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1105. [2024-10-11 19:05:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 660 states have (on average 2.125757575757576) internal successors, (1403), 1096 states have internal predecessors, (1403), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1415 transitions. [2024-10-11 19:05:30,455 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1415 transitions. Word has length 11 [2024-10-11 19:05:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:30,455 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1415 transitions. [2024-10-11 19:05:30,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:05:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1415 transitions. [2024-10-11 19:05:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 19:05:30,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:30,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:30,462 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:05:30,656 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:05:30,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr523ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:30,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash 50893139, now seen corresponding path program 1 times [2024-10-11 19:05:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947386379] [2024-10-11 19:05:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:30,657 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:05:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:30,658 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:05:30,659 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:05:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:30,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:05:30,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:30,840 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-11 19:05:30,841 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:05:30,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:30,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947386379] [2024-10-11 19:05:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947386379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085600820] [2024-10-11 19:05:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:05:30,842 INFO L87 Difference]: Start difference. First operand 1105 states and 1415 transitions. Second operand has 4 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:05:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:32,187 INFO L93 Difference]: Finished difference Result 1425 states and 1818 transitions. [2024-10-11 19:05:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 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:05:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:32,191 INFO L225 Difference]: With dead ends: 1425 [2024-10-11 19:05:32,191 INFO L226 Difference]: Without dead ends: 1421 [2024-10-11 19:05:32,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-11 19:05:32,191 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 294 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1230 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:32,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1173 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 681 Invalid, 0 Unknown, 1230 Unchecked, 1.3s Time] [2024-10-11 19:05:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-10-11 19:05:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1174. [2024-10-11 19:05:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 728 states have (on average 2.1016483516483517) internal successors, (1530), 1164 states have internal predecessors, (1530), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1544 transitions. [2024-10-11 19:05:32,208 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1544 transitions. Word has length 12 [2024-10-11 19:05:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:32,208 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1544 transitions. [2024-10-11 19:05:32,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:05:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1544 transitions. [2024-10-11 19:05:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 19:05:32,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:32,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:32,215 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:05:32,409 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:05:32,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 985945624, now seen corresponding path program 1 times [2024-10-11 19:05:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311213438] [2024-10-11 19:05:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:32,411 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:05:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:32,413 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:05:32,414 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:05:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:32,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:05:32,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:32,508 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:05:32,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:32,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311213438] [2024-10-11 19:05:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311213438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144570529] [2024-10-11 19:05:32,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:32,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:32,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:32,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:32,510 INFO L87 Difference]: Start difference. First operand 1174 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:05:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:32,966 INFO L93 Difference]: Finished difference Result 1105 states and 1424 transitions. [2024-10-11 19:05:32,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:32,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:05:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:32,970 INFO L225 Difference]: With dead ends: 1105 [2024-10-11 19:05:32,970 INFO L226 Difference]: Without dead ends: 1105 [2024-10-11 19:05:32,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:05:32,972 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 61 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:32,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1508 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:05:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-10-11 19:05:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-10-11 19:05:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 683 states have (on average 2.0644216691068813) internal successors, (1410), 1095 states have internal predecessors, (1410), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1424 transitions. [2024-10-11 19:05:32,985 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1424 transitions. Word has length 13 [2024-10-11 19:05:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:32,986 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1424 transitions. [2024-10-11 19:05:32,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:05:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1424 transitions. [2024-10-11 19:05:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:05:32,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:32,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:32,994 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:05:33,187 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:05:33,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:33,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1694002318, now seen corresponding path program 1 times [2024-10-11 19:05:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:33,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145972551] [2024-10-11 19:05:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:33,188 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:05:33,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:33,191 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:05:33,192 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:05:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:33,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:33,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:33,313 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:05:33,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:33,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145972551] [2024-10-11 19:05:33,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145972551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:33,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:33,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850816967] [2024-10-11 19:05:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:33,314 INFO L87 Difference]: Start difference. First operand 1105 states and 1424 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:05:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:33,933 INFO L93 Difference]: Finished difference Result 1088 states and 1358 transitions. [2024-10-11 19:05:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:05:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 19:05:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:33,937 INFO L225 Difference]: With dead ends: 1088 [2024-10-11 19:05:33,937 INFO L226 Difference]: Without dead ends: 1088 [2024-10-11 19:05:33,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:05:33,938 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 45 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:33,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2214 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:05:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-10-11 19:05:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-10-11 19:05:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 680 states have (on average 1.9764705882352942) internal successors, (1344), 1078 states have internal predecessors, (1344), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1358 transitions. [2024-10-11 19:05:33,952 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1358 transitions. Word has length 15 [2024-10-11 19:05:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1358 transitions. [2024-10-11 19:05:33,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:05:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1358 transitions. [2024-10-11 19:05:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 19:05:33,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:33,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:33,958 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:05:34,156 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:05:34,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:34,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:34,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1265994533, now seen corresponding path program 1 times [2024-10-11 19:05:34,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:34,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97489670] [2024-10-11 19:05:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:34,157 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:05:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:34,159 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:05:34,159 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:05:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:34,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:05:34,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:34,291 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:05:34,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:34,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97489670] [2024-10-11 19:05:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97489670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302525291] [2024-10-11 19:05:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:34,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:34,292 INFO L87 Difference]: Start difference. First operand 1088 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:05:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:34,776 INFO L93 Difference]: Finished difference Result 1034 states and 1278 transitions. [2024-10-11 19:05:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-11 19:05:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:34,780 INFO L225 Difference]: With dead ends: 1034 [2024-10-11 19:05:34,780 INFO L226 Difference]: Without dead ends: 1034 [2024-10-11 19:05:34,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:05:34,781 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 61 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:34,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1392 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:05:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-11 19:05:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-11 19:05:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 650 states have (on average 1.9446153846153846) internal successors, (1264), 1024 states have internal predecessors, (1264), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1278 transitions. [2024-10-11 19:05:34,794 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1278 transitions. Word has length 16 [2024-10-11 19:05:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:34,794 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1278 transitions. [2024-10-11 19:05:34,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:05:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1278 transitions. [2024-10-11 19:05:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 19:05:34,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:34,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:05:34,803 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 (12)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:34,997 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:05:34,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1144998559, now seen corresponding path program 1 times [2024-10-11 19:05:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840212956] [2024-10-11 19:05:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:34,999 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:05:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:35,000 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:05:35,001 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:05:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:35,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:35,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:35,131 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:05:35,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:35,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840212956] [2024-10-11 19:05:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840212956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567974281] [2024-10-11 19:05:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:35,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:35,133 INFO L87 Difference]: Start difference. First operand 1034 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:05:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:35,742 INFO L93 Difference]: Finished difference Result 1018 states and 1234 transitions. [2024-10-11 19:05:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:05:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-10-11 19:05:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:35,745 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 19:05:35,745 INFO L226 Difference]: Without dead ends: 1018 [2024-10-11 19:05:35,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:05:35,746 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 45 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:35,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2040 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:05:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-10-11 19:05:35,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2024-10-11 19:05:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 648 states have (on average 1.882716049382716) internal successors, (1220), 1008 states have internal predecessors, (1220), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1234 transitions. [2024-10-11 19:05:35,757 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1234 transitions. Word has length 18 [2024-10-11 19:05:35,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:35,757 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1234 transitions. [2024-10-11 19:05:35,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:05:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1234 transitions. [2024-10-11 19:05:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 19:05:35,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:35,758 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] [2024-10-11 19:05:35,764 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:05:35,958 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:05:35,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1385816352, now seen corresponding path program 1 times [2024-10-11 19:05:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176237443] [2024-10-11 19:05:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:35,959 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:05:35,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:35,961 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:05:35,962 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:05:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:36,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:05:36,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:36,071 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:05:36,144 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:05:36,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:36,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:36,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176237443] [2024-10-11 19:05:36,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176237443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:36,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:36,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546529047] [2024-10-11 19:05:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:36,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:36,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:36,147 INFO L87 Difference]: Start difference. First operand 1018 states and 1234 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:05:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:37,266 INFO L93 Difference]: Finished difference Result 1034 states and 1242 transitions. [2024-10-11 19:05:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:37,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-11 19:05:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:37,269 INFO L225 Difference]: With dead ends: 1034 [2024-10-11 19:05:37,269 INFO L226 Difference]: Without dead ends: 1034 [2024-10-11 19:05:37,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:05:37,269 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 697 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:37,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 855 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:05:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-11 19:05:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1014. [2024-10-11 19:05:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 648 states have (on average 1.8641975308641976) internal successors, (1208), 1004 states have internal predecessors, (1208), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1222 transitions. [2024-10-11 19:05:37,279 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1222 transitions. Word has length 29 [2024-10-11 19:05:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:37,280 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1222 transitions. [2024-10-11 19:05:37,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:05:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1222 transitions. [2024-10-11 19:05:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 19:05:37,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:37,280 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] [2024-10-11 19:05:37,284 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:05:37,481 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:05:37,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:37,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:37,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1385816351, now seen corresponding path program 1 times [2024-10-11 19:05:37,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:37,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356741769] [2024-10-11 19:05:37,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:37,482 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:05:37,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:37,485 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:05:37,487 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:05:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:37,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:05:37,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:37,600 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:05:37,743 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:05:37,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:37,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356741769] [2024-10-11 19:05:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356741769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:37,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:37,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:05:37,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853252705] [2024-10-11 19:05:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:37,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:37,746 INFO L87 Difference]: Start difference. First operand 1014 states and 1222 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:05:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:39,669 INFO L93 Difference]: Finished difference Result 1445 states and 1777 transitions. [2024-10-11 19:05:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-11 19:05:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:39,673 INFO L225 Difference]: With dead ends: 1445 [2024-10-11 19:05:39,673 INFO L226 Difference]: Without dead ends: 1445 [2024-10-11 19:05:39,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:05:39,673 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 332 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:39,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1313 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:05:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-10-11 19:05:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1284. [2024-10-11 19:05:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 916 states have (on average 1.8919213973799127) internal successors, (1733), 1272 states have internal predecessors, (1733), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:05:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1751 transitions. [2024-10-11 19:05:39,692 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1751 transitions. Word has length 29 [2024-10-11 19:05:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:39,693 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1751 transitions. [2024-10-11 19:05:39,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:05:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1751 transitions. [2024-10-11 19:05:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 19:05:39,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:39,694 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] [2024-10-11 19:05:39,702 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:05:39,894 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:05:39,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 874153197, now seen corresponding path program 1 times [2024-10-11 19:05:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706552355] [2024-10-11 19:05:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:39,896 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:05:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:39,898 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:05:39,899 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:05:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:40,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:05:40,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:40,037 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:05:40,092 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:05:40,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:40,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:40,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706552355] [2024-10-11 19:05:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706552355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733276129] [2024-10-11 19:05:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:40,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:40,094 INFO L87 Difference]: Start difference. First operand 1284 states and 1751 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:05:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:41,585 INFO L93 Difference]: Finished difference Result 1690 states and 2281 transitions. [2024-10-11 19:05:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-11 19:05:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:41,591 INFO L225 Difference]: With dead ends: 1690 [2024-10-11 19:05:41,591 INFO L226 Difference]: Without dead ends: 1690 [2024-10-11 19:05:41,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:05:41,593 INFO L432 NwaCegarLoop]: 651 mSDtfsCounter, 703 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:41,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1316 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:05:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-10-11 19:05:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1280. [2024-10-11 19:05:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 916 states have (on average 1.8831877729257642) internal successors, (1725), 1268 states have internal predecessors, (1725), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:05:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1743 transitions. [2024-10-11 19:05:41,612 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1743 transitions. Word has length 32 [2024-10-11 19:05:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1743 transitions. [2024-10-11 19:05:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:05:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1743 transitions. [2024-10-11 19:05:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 19:05:41,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:41,616 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] [2024-10-11 19:05:41,622 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:05:41,816 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:05:41,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash 874153198, now seen corresponding path program 1 times [2024-10-11 19:05:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013270552] [2024-10-11 19:05:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:41,818 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:05:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:41,822 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:05:41,825 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:05:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:41,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:05:41,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:41,965 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:05:42,097 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:05:42,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:42,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013270552] [2024-10-11 19:05:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013270552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:42,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157233650] [2024-10-11 19:05:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:42,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:42,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:42,114 INFO L87 Difference]: Start difference. First operand 1280 states and 1743 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:05:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:44,101 INFO L93 Difference]: Finished difference Result 1747 states and 2302 transitions. [2024-10-11 19:05:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-11 19:05:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:44,110 INFO L225 Difference]: With dead ends: 1747 [2024-10-11 19:05:44,110 INFO L226 Difference]: Without dead ends: 1747 [2024-10-11 19:05:44,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:05:44,110 INFO L432 NwaCegarLoop]: 876 mSDtfsCounter, 489 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:44,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1738 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:05:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-10-11 19:05:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1276. [2024-10-11 19:05:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 916 states have (on average 1.8744541484716157) internal successors, (1717), 1264 states have internal predecessors, (1717), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:05:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1735 transitions. [2024-10-11 19:05:44,125 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1735 transitions. Word has length 32 [2024-10-11 19:05:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:44,125 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1735 transitions. [2024-10-11 19:05:44,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:05:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1735 transitions. [2024-10-11 19:05:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 19:05:44,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:44,128 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] [2024-10-11 19:05:44,133 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:05:44,329 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:05:44,329 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1598252439, now seen corresponding path program 1 times [2024-10-11 19:05:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542565513] [2024-10-11 19:05:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:44,331 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:05:44,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:44,332 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:05:44,333 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:05:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:44,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:44,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:44,496 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:05:44,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:44,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:44,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542565513] [2024-10-11 19:05:44,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542565513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:44,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946999366] [2024-10-11 19:05:44,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:44,498 INFO L87 Difference]: Start difference. First operand 1276 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:05:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:45,070 INFO L93 Difference]: Finished difference Result 1246 states and 1685 transitions. [2024-10-11 19:05:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:05:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2024-10-11 19:05:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:45,074 INFO L225 Difference]: With dead ends: 1246 [2024-10-11 19:05:45,075 INFO L226 Difference]: Without dead ends: 1246 [2024-10-11 19:05:45,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:05:45,075 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 21 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:45,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2005 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:05:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-10-11 19:05:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246. [2024-10-11 19:05:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 886 states have (on average 1.881489841986456) internal successors, (1667), 1234 states have internal predecessors, (1667), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:05:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1685 transitions. [2024-10-11 19:05:45,087 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1685 transitions. Word has length 48 [2024-10-11 19:05:45,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:45,088 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 1685 transitions. [2024-10-11 19:05:45,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:05:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1685 transitions. [2024-10-11 19:05:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:05:45,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:45,088 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] [2024-10-11 19:05:45,094 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 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:45,288 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:05:45,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:45,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1192229815, now seen corresponding path program 1 times [2024-10-11 19:05:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69568710] [2024-10-11 19:05:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:45,290 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:05:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:45,291 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:05:45,293 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:05:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:45,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:45,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:45,487 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:05:45,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:45,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69568710] [2024-10-11 19:05:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69568710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30382515] [2024-10-11 19:05:45,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:45,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:45,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:45,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:45,488 INFO L87 Difference]: Start difference. First operand 1246 states and 1685 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:05:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:46,136 INFO L93 Difference]: Finished difference Result 1234 states and 1665 transitions. [2024-10-11 19:05:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:05:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-10-11 19:05:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:46,144 INFO L225 Difference]: With dead ends: 1234 [2024-10-11 19:05:46,144 INFO L226 Difference]: Without dead ends: 1234 [2024-10-11 19:05:46,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:05:46,144 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 15 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:46,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1999 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:05:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-10-11 19:05:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2024-10-11 19:05:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 874 states have (on average 1.8844393592677346) internal successors, (1647), 1222 states have internal predecessors, (1647), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 19:05:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1665 transitions. [2024-10-11 19:05:46,163 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1665 transitions. Word has length 51 [2024-10-11 19:05:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:46,163 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1665 transitions. [2024-10-11 19:05:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:05:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1665 transitions. [2024-10-11 19:05:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 19:05:46,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:46,164 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] [2024-10-11 19:05:46,170 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:05:46,365 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:05:46,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1092574424, now seen corresponding path program 1 times [2024-10-11 19:05:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:46,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211920356] [2024-10-11 19:05:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:46,366 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:05:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:46,367 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:05:46,369 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:05:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:46,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:46,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:46,555 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:05:46,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:46,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211920356] [2024-10-11 19:05:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211920356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772643193] [2024-10-11 19:05:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:05:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:05:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:05:46,558 INFO L87 Difference]: Start difference. First operand 1234 states and 1665 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:47,096 INFO L93 Difference]: Finished difference Result 1066 states and 1155 transitions. [2024-10-11 19:05:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:05:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-11 19:05:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:47,099 INFO L225 Difference]: With dead ends: 1066 [2024-10-11 19:05:47,099 INFO L226 Difference]: Without dead ends: 1066 [2024-10-11 19:05:47,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:05:47,099 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 93 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:47,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1366 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:05:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-10-11 19:05:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 929. [2024-10-11 19:05:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 571 states have (on average 1.746059544658494) internal successors, (997), 919 states have internal predecessors, (997), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 19:05:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1011 transitions. [2024-10-11 19:05:47,108 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1011 transitions. Word has length 52 [2024-10-11 19:05:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:47,108 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1011 transitions. [2024-10-11 19:05:47,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:05:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1011 transitions. [2024-10-11 19:05:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:05:47,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:47,109 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] [2024-10-11 19:05:47,114 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 (20)] Forceful destruction successful, exit code 0 [2024-10-11 19:05:47,314 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:05:47,314 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 929073503, now seen corresponding path program 1 times [2024-10-11 19:05:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:47,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051306331] [2024-10-11 19:05:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:47,315 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:05:47,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:47,316 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:05:47,318 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:05:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:47,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:05:47,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:47,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:05:47,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:05:47,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:05:47,503 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 30 treesize of output 39 [2024-10-11 19:05:47,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:05:47,548 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 70 treesize of output 26 [2024-10-11 19:05:47,583 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:05:47,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:47,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051306331] [2024-10-11 19:05:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051306331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:05:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672609157] [2024-10-11 19:05:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:05:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:05:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:05:47,588 INFO L87 Difference]: Start difference. First operand 929 states and 1011 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:05:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:48,915 INFO L93 Difference]: Finished difference Result 1538 states and 1656 transitions. [2024-10-11 19:05:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:05:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 19:05:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:48,924 INFO L225 Difference]: With dead ends: 1538 [2024-10-11 19:05:48,924 INFO L226 Difference]: Without dead ends: 1535 [2024-10-11 19:05:48,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:05:48,924 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 1431 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:48,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 3195 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:05:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-11 19:05:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 881. [2024-10-11 19:05:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 524 states have (on average 1.8110687022900764) internal successors, (949), 872 states have internal predecessors, (949), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 961 transitions. [2024-10-11 19:05:48,935 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 961 transitions. Word has length 55 [2024-10-11 19:05:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:48,935 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 961 transitions. [2024-10-11 19:05:48,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:05:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 961 transitions. [2024-10-11 19:05:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 19:05:48,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:48,936 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] [2024-10-11 19:05:48,945 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 (21)] Ended with exit code 0 [2024-10-11 19:05:49,136 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:05:49,136 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 642490614, now seen corresponding path program 1 times [2024-10-11 19:05:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536995046] [2024-10-11 19:05:49,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:49,137 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:05:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:49,138 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:05:49,139 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:05:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:49,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:05:49,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:49,402 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:05:49,409 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:05:49,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:05:49,747 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:05:49,759 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:05:49,760 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:05:49,770 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:05:49,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:49,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536995046] [2024-10-11 19:05:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536995046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:49,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:49,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:05:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189180695] [2024-10-11 19:05:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:49,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:49,773 INFO L87 Difference]: Start difference. First operand 881 states and 961 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:05:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:51,310 INFO L93 Difference]: Finished difference Result 1181 states and 1285 transitions. [2024-10-11 19:05:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:51,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-11 19:05:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:51,314 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 19:05:51,314 INFO L226 Difference]: Without dead ends: 1181 [2024-10-11 19:05:51,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:05:51,315 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1562 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:51,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 327 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:05:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-10-11 19:05:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 816. [2024-10-11 19:05:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 497 states have (on average 1.704225352112676) internal successors, (847), 807 states have internal predecessors, (847), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 859 transitions. [2024-10-11 19:05:51,323 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 859 transitions. Word has length 55 [2024-10-11 19:05:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:51,324 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 859 transitions. [2024-10-11 19:05:51,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:05:51,324 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 859 transitions. [2024-10-11 19:05:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:05:51,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:51,324 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] [2024-10-11 19:05:51,331 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 (22)] Ended with exit code 0 [2024-10-11 19:05:51,524 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:05:51,525 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 847592822, now seen corresponding path program 1 times [2024-10-11 19:05:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775804332] [2024-10-11 19:05:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:51,526 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:05:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:51,527 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:05:51,528 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:05:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:51,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:05:51,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:51,731 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:05:51,740 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:05:51,752 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:05:51,760 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:05:51,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:51,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:51,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775804332] [2024-10-11 19:05:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775804332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055156407] [2024-10-11 19:05:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:51,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:05:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:05:51,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:05:51,762 INFO L87 Difference]: Start difference. First operand 816 states and 859 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:05:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:53,268 INFO L93 Difference]: Finished difference Result 815 states and 858 transitions. [2024-10-11 19:05:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:05:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-11 19:05:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:53,270 INFO L225 Difference]: With dead ends: 815 [2024-10-11 19:05:53,271 INFO L226 Difference]: Without dead ends: 815 [2024-10-11 19:05:53,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:05:53,271 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 2 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:53,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1688 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 19:05:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-10-11 19:05:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2024-10-11 19:05:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 497 states have (on average 1.7022132796780685) internal successors, (846), 806 states have internal predecessors, (846), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 858 transitions. [2024-10-11 19:05:53,294 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 858 transitions. Word has length 59 [2024-10-11 19:05:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:53,294 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 858 transitions. [2024-10-11 19:05:53,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:05:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 858 transitions. [2024-10-11 19:05:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 19:05:53,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:53,294 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] [2024-10-11 19:05:53,303 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 (23)] Ended with exit code 0 [2024-10-11 19:05:53,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:05:53,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:53,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 847592823, now seen corresponding path program 1 times [2024-10-11 19:05:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004144730] [2024-10-11 19:05:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:53,496 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:05:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:53,499 INFO L229 MonitoredProcess]: Starting monitored process 24 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:05:53,499 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 (24)] Waiting until timeout for monitored process [2024-10-11 19:05:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:53,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:05:53,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:53,733 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:05:53,744 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:05:53,749 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:05:53,773 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:05:53,787 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:05:53,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:53,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004144730] [2024-10-11 19:05:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004144730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:53,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797190962] [2024-10-11 19:05:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:05:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:05:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:05:53,788 INFO L87 Difference]: Start difference. First operand 815 states and 858 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:05:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:55,756 INFO L93 Difference]: Finished difference Result 814 states and 857 transitions. [2024-10-11 19:05:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:05:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-11 19:05:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:55,762 INFO L225 Difference]: With dead ends: 814 [2024-10-11 19:05:55,762 INFO L226 Difference]: Without dead ends: 814 [2024-10-11 19:05:55,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:05:55,762 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 1 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:55,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1712 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:05:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-10-11 19:05:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2024-10-11 19:05:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 496 states have (on average 1.7036290322580645) internal successors, (845), 805 states have internal predecessors, (845), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 19:05:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 857 transitions. [2024-10-11 19:05:55,769 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 857 transitions. Word has length 59 [2024-10-11 19:05:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:55,769 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 857 transitions. [2024-10-11 19:05:55,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:05:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 857 transitions. [2024-10-11 19:05:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:05:55,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:55,770 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:05:55,778 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 (24)] Ended with exit code 0 [2024-10-11 19:05:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:05:55,970 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1122666310, now seen corresponding path program 1 times [2024-10-11 19:05:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800673863] [2024-10-11 19:05:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:55,971 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:05:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:55,973 INFO L229 MonitoredProcess]: Starting monitored process 25 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:05:55,973 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 (25)] Waiting until timeout for monitored process [2024-10-11 19:05:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:56,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:05:56,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:56,220 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:05:56,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:05:56,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800673863] [2024-10-11 19:05:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800673863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:05:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:05:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:05:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243235229] [2024-10-11 19:05:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:05:56,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:05:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:05:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:05:56,222 INFO L87 Difference]: Start difference. First operand 814 states and 857 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:05:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:56,860 INFO L93 Difference]: Finished difference Result 816 states and 860 transitions. [2024-10-11 19:05:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:05:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-11 19:05:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:56,866 INFO L225 Difference]: With dead ends: 816 [2024-10-11 19:05:56,866 INFO L226 Difference]: Without dead ends: 816 [2024-10-11 19:05:56,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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:05:56,866 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 0 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:56,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1935 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:05:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-11 19:05:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2024-10-11 19:05:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 497 states have (on average 1.704225352112676) internal successors, (847), 807 states have internal predecessors, (847), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:05:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 860 transitions. [2024-10-11 19:05:56,879 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 860 transitions. Word has length 65 [2024-10-11 19:05:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:56,879 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 860 transitions. [2024-10-11 19:05:56,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:05:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 860 transitions. [2024-10-11 19:05:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 19:05:56,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:56,880 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, 1] [2024-10-11 19:05:56,888 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 (25)] Ended with exit code 0 [2024-10-11 19:05:57,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:05:57,080 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:57,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1504503391, now seen corresponding path program 1 times [2024-10-11 19:05:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241993615] [2024-10-11 19:05:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:05:57,081 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:05:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:57,083 INFO L229 MonitoredProcess]: Starting monitored process 26 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:05:57,084 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 (26)] Waiting until timeout for monitored process [2024-10-11 19:05:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:05:57,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:05:57,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:57,341 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:05:57,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:05:57,389 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:05:57,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241993615] [2024-10-11 19:05:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241993615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:05:57,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:05:57,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:05:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079943354] [2024-10-11 19:05:57,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:05:57,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:05:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:57,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:05:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:05:57,391 INFO L87 Difference]: Start difference. First operand 816 states and 860 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:05:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:05:58,170 INFO L93 Difference]: Finished difference Result 825 states and 874 transitions. [2024-10-11 19:05:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:05:58,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2024-10-11 19:05:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:05:58,174 INFO L225 Difference]: With dead ends: 825 [2024-10-11 19:05:58,174 INFO L226 Difference]: Without dead ends: 825 [2024-10-11 19:05:58,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:05:58,174 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 5 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:05:58,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2576 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 19:05:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-11 19:05:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 824. [2024-10-11 19:05:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 504 states have (on average 1.7063492063492063) internal successors, (860), 814 states have internal predecessors, (860), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:05:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 873 transitions. [2024-10-11 19:05:58,184 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 873 transitions. Word has length 66 [2024-10-11 19:05:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:05:58,184 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 873 transitions. [2024-10-11 19:05:58,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:05:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 873 transitions. [2024-10-11 19:05:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 19:05:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:05:58,185 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, 1] [2024-10-11 19:05:58,192 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 (26)] Ended with exit code 0 [2024-10-11 19:05:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:05:58,385 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:05:58,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:05:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -269878662, now seen corresponding path program 2 times [2024-10-11 19:05:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:05:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565537110] [2024-10-11 19:05:58,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:05:58,386 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:05:58,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:05:58,387 INFO L229 MonitoredProcess]: Starting monitored process 27 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:05:58,388 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 (27)] Waiting until timeout for monitored process [2024-10-11 19:05:58,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:05:58,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:05:58,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:05:58,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:05:58,804 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:05:58,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:05:58,920 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:05:58,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:05:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565537110] [2024-10-11 19:05:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565537110] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:05:58,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:05:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:05:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179527364] [2024-10-11 19:05:58,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:05:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:05:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:05:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:05:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:05:58,922 INFO L87 Difference]: Start difference. First operand 824 states and 873 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:06:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:00,243 INFO L93 Difference]: Finished difference Result 836 states and 892 transitions. [2024-10-11 19:06:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:06:00,245 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2024-10-11 19:06:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:00,247 INFO L225 Difference]: With dead ends: 836 [2024-10-11 19:06:00,247 INFO L226 Difference]: Without dead ends: 834 [2024-10-11 19:06:00,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 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:06:00,247 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 7 mSDsluCounter, 3220 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:00,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3865 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:06:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-11 19:06:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 833. [2024-10-11 19:06:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 513 states have (on average 1.6998050682261208) internal successors, (872), 823 states have internal predecessors, (872), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:06:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 885 transitions. [2024-10-11 19:06:00,257 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 885 transitions. Word has length 69 [2024-10-11 19:06:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 885 transitions. [2024-10-11 19:06:00,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:06:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 885 transitions. [2024-10-11 19:06:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 19:06:00,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:00,258 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, 1] [2024-10-11 19:06:00,266 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 (27)] Forceful destruction successful, exit code 0 [2024-10-11 19:06:00,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:06:00,459 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:06:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 685824282, now seen corresponding path program 3 times [2024-10-11 19:06:00,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781033417] [2024-10-11 19:06:00,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:06:00,460 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:06:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:00,461 INFO L229 MonitoredProcess]: Starting monitored process 28 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:06:00,462 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 (28)] Waiting until timeout for monitored process [2024-10-11 19:06:01,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:06:01,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:06:01,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:06:01,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:01,168 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:06:01,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:06:01,571 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:06:01,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781033417] [2024-10-11 19:06:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781033417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:06:01,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:06:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:06:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634150481] [2024-10-11 19:06:01,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:06:01,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:06:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:06:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:06:01,574 INFO L87 Difference]: Start difference. First operand 833 states and 885 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:06:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:04,906 INFO L93 Difference]: Finished difference Result 854 states and 921 transitions. [2024-10-11 19:06:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:06:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2024-10-11 19:06:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:04,908 INFO L225 Difference]: With dead ends: 854 [2024-10-11 19:06:04,908 INFO L226 Difference]: Without dead ends: 851 [2024-10-11 19:06:04,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 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:06:04,909 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 13 mSDsluCounter, 7724 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8369 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:04,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8369 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 19:06:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-10-11 19:06:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2024-10-11 19:06:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 531 states have (on average 1.6854990583804144) internal successors, (895), 841 states have internal predecessors, (895), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:06:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 908 transitions. [2024-10-11 19:06:04,921 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 908 transitions. Word has length 75 [2024-10-11 19:06:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:04,922 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 908 transitions. [2024-10-11 19:06:04,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:06:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 908 transitions. [2024-10-11 19:06:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 19:06:04,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:04,923 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, 1] [2024-10-11 19:06:04,933 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 (28)] Ended with exit code 0 [2024-10-11 19:06:05,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:06:05,124 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:06:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 840707674, now seen corresponding path program 4 times [2024-10-11 19:06:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726882773] [2024-10-11 19:06:05,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:06:05,125 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:06:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:05,127 INFO L229 MonitoredProcess]: Starting monitored process 29 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:06:05,128 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 (29)] Waiting until timeout for monitored process [2024-10-11 19:06:05,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:06:05,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:06:05,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:06:05,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:05,852 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:06:05,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:06:06,842 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:06:06,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726882773] [2024-10-11 19:06:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726882773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:06:06,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:06:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:06:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620919729] [2024-10-11 19:06:06,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:06:06,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:06:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:06:06,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:06:06,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:06:06,845 INFO L87 Difference]: Start difference. First operand 851 states and 908 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:06:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:06:14,664 INFO L93 Difference]: Finished difference Result 888 states and 977 transitions. [2024-10-11 19:06:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:06:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2024-10-11 19:06:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:06:14,667 INFO L225 Difference]: With dead ends: 888 [2024-10-11 19:06:14,667 INFO L226 Difference]: Without dead ends: 886 [2024-10-11 19:06:14,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:06:14,673 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 26 mSDsluCounter, 14812 mSDsCounter, 0 mSdLazyCounter, 3764 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 15457 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 3764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:06:14,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 15457 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 3764 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 19:06:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-11 19:06:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 885. [2024-10-11 19:06:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 565 states have (on average 1.665486725663717) internal successors, (941), 875 states have internal predecessors, (941), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-11 19:06:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 954 transitions. [2024-10-11 19:06:14,681 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 954 transitions. Word has length 87 [2024-10-11 19:06:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:06:14,681 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 954 transitions. [2024-10-11 19:06:14,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:06:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 954 transitions. [2024-10-11 19:06:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 19:06:14,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:06:14,683 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, 1] [2024-10-11 19:06:14,694 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 (29)] Forceful destruction successful, exit code 0 [2024-10-11 19:06:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:06:14,884 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-11 19:06:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:06:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash -285414406, now seen corresponding path program 5 times [2024-10-11 19:06:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:06:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435021114] [2024-10-11 19:06:14,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:06:14,885 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:06:14,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:06:14,886 INFO L229 MonitoredProcess]: Starting monitored process 30 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:06:14,887 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 (30)] Waiting until timeout for monitored process [2024-10-11 19:06:15,966 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:06:15,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:06:15,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:06:15,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:06:16,003 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:06:16,078 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:06:16,078 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:06:16,104 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:06:16,179 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:06:16,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:06:16,980 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:06:17,023 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:06:17,050 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:06:17,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:06:17,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 (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_2197) |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:06:17,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:06:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435021114] [2024-10-11 19:06:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435021114] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:06:17,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1449334804] [2024-10-11 19:06:17,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:06:17,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:06:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:06:17,337 INFO L229 MonitoredProcess]: Starting monitored process 31 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:06:17,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process