./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_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:48:57,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:48:57,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:48:57,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:48:57,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:48:57,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:48:57,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:48:57,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:48:57,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:48:57,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:48:57,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:48:57,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:48:57,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:48:57,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:48:57,205 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:48:57,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:48:57,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:48:57,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:48:57,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:48:57,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:48:57,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:48:57,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:48:57,208 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:48:57,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:48:57,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:48:57,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:48:57,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:48:57,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:48:57,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:48:57,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:48:57,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:48:57,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:48:57,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:48:57,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:48:57,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:48:57,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:48:57,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:48:57,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:48:57,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:48:57,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:48:57,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:48:57,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:48:57,215 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2024-10-13 11:48:57,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:48:57,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:48:57,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:48:57,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:48:57,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:48:57,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-10-13 11:48:59,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:48:59,325 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:48:59,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-10-13 11:48:59,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3062c1c13/ed4c6cab1776432f88e2b9dd90c563d0/FLAG17d0b2076 [2024-10-13 11:48:59,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3062c1c13/ed4c6cab1776432f88e2b9dd90c563d0 [2024-10-13 11:48:59,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:48:59,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:48:59,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:48:59,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:48:59,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:48:59,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:48:59" (1/1) ... [2024-10-13 11:48:59,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fab6c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:48:59, skipping insertion in model container [2024-10-13 11:48:59,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:48:59" (1/1) ... [2024-10-13 11:48:59,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:49:00,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:49:00,154 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-13 11:49:00,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5dc71aa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:00, skipping insertion in model container [2024-10-13 11:49:00,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:49:00,156 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:49:00,158 INFO L158 Benchmark]: Toolchain (without parser) took 780.24ms. Allocated memory is still 178.3MB. Free memory was 105.3MB in the beginning and 131.6MB in the end (delta: -26.3MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 11:49:00,159 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:49:00,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.32ms. Allocated memory is still 178.3MB. Free memory was 105.1MB in the beginning and 131.6MB in the end (delta: -26.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 11:49:00,160 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.21ms. Allocated memory is still 178.3MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.32ms. Allocated memory is still 178.3MB. Free memory was 105.1MB in the beginning and 131.6MB in the end (delta: -26.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:49:02,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:49:02,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:49:02,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:49:02,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:49:02,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:49:02,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:49:02,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:49:02,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:49:02,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:49:02,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:49:02,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:49:02,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:49:02,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:49:02,346 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:49:02,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:49:02,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:49:02,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:49:02,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:49:02,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:49:02,351 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:49:02,351 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:49:02,351 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:49:02,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:49:02,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:49:02,352 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:49:02,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:49:02,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:49:02,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:49:02,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:49:02,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:49:02,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:49:02,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:49:02,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:49:02,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:49:02,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:49:02,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:49:02,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:49:02,356 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:49:02,357 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:49:02,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:49:02,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:49:02,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:49:02,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:49:02,358 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:49:02,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2024-10-13 11:49:02,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:49:02,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:49:02,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:49:02,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:49:02,723 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:49:02,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-10-13 11:49:04,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:49:04,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:49:04,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-10-13 11:49:04,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c79dfbec/f2995087ca774e04be03022ac9ea22ca/FLAGa017a7c42 [2024-10-13 11:49:04,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c79dfbec/f2995087ca774e04be03022ac9ea22ca [2024-10-13 11:49:04,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:49:04,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:49:04,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:49:04,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:49:04,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:49:04,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:49:04" (1/1) ... [2024-10-13 11:49:04,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c7dc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:04, skipping insertion in model container [2024-10-13 11:49:04,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:49:04" (1/1) ... [2024-10-13 11:49:04,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:49:05,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:49:05,667 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:49:05,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:49:05,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:49:05,858 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:49:05,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:49:06,051 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:49:06,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06 WrapperNode [2024-10-13 11:49:06,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:49:06,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:49:06,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:49:06,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:49:06,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,214 INFO L138 Inliner]: procedures = 180, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2272 [2024-10-13 11:49:06,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:49:06,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:49:06,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:49:06,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:49:06,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,386 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-10-13 11:49:06,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:49:06,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:49:06,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:49:06,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:49:06,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (1/1) ... [2024-10-13 11:49:06,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:49:06,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:49:06,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:49:06,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-13 11:49:06,620 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:49:06,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:49:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:49:06,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:49:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:49:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:49:06,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:49:06,621 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:49:06,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:49:06,622 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:49:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:49:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:49:06,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:49:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:49:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:49:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:49:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:49:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:49:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:49:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:49:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:49:06,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:49:06,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:49:06,966 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:49:06,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:49:07,048 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:49:07,085 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:49:07,147 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:49:15,160 INFO L? ?]: Removed 2009 outVars from TransFormulas that were not future-live. [2024-10-13 11:49:15,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:49:15,449 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:49:15,450 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-13 11:49:15,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:49:15 BoogieIcfgContainer [2024-10-13 11:49:15,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:49:15,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:49:15,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:49:15,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:49:15,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:49:04" (1/3) ... [2024-10-13 11:49:15,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60362d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:49:15, skipping insertion in model container [2024-10-13 11:49:15,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:49:06" (2/3) ... [2024-10-13 11:49:15,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60362d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:49:15, skipping insertion in model container [2024-10-13 11:49:15,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:49:15" (3/3) ... [2024-10-13 11:49:15,460 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-1.i [2024-10-13 11:49:15,480 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:49:15,481 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-10-13 11:49:15,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:49:15,636 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;@44de86a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:49:15,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-10-13 11:49:15,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 11:49:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:49:15,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:15,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:49:15,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 110388, now seen corresponding path program 1 times [2024-10-13 11:49:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086780417] [2024-10-13 11:49:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:15,676 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-13 11:49:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:15,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:15,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:49:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:15,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:49:15,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:15,947 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-13 11:49:15,969 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-13 11:49:15,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:15,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086780417] [2024-10-13 11:49:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086780417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:49:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400964766] [2024-10-13 11:49:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:16,041 INFO L87 Difference]: Start difference. First operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:19,407 INFO L93 Difference]: Finished difference Result 2312 states and 2476 transitions. [2024-10-13 11:49:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:49:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:19,448 INFO L225 Difference]: With dead ends: 2312 [2024-10-13 11:49:19,448 INFO L226 Difference]: Without dead ends: 2311 [2024-10-13 11:49:19,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:19,453 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1769 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:19,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1370 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 11:49:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-13 11:49:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1986. [2024-10-13 11:49:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1016 states have (on average 2.2401574803149606) internal successors, (2276), 1970 states have internal predecessors, (2276), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:49:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2308 transitions. [2024-10-13 11:49:19,611 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2308 transitions. Word has length 2 [2024-10-13 11:49:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2308 transitions. [2024-10-13 11:49:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2308 transitions. [2024-10-13 11:49:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:49:19,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:19,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:49:19,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:49:19,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:19,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash 110389, now seen corresponding path program 1 times [2024-10-13 11:49:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297413703] [2024-10-13 11:49:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:19,820 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-13 11:49:19,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:19,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:19,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:49:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:19,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:49:19,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:19,984 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-13 11:49:20,000 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-13 11:49:20,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:20,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297413703] [2024-10-13 11:49:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297413703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:49:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914268270] [2024-10-13 11:49:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:20,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:20,006 INFO L87 Difference]: Start difference. First operand 1986 states and 2308 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:25,064 INFO L93 Difference]: Finished difference Result 2711 states and 3113 transitions. [2024-10-13 11:49:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:49:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:25,077 INFO L225 Difference]: With dead ends: 2711 [2024-10-13 11:49:25,079 INFO L226 Difference]: Without dead ends: 2711 [2024-10-13 11:49:25,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:25,080 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 799 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:25,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2504 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-13 11:49:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2024-10-13 11:49:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2383. [2024-10-13 11:49:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1411 states have (on average 2.179305457122608) internal successors, (3075), 2364 states have internal predecessors, (3075), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 11:49:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3113 transitions. [2024-10-13 11:49:25,154 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3113 transitions. Word has length 2 [2024-10-13 11:49:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:25,154 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3113 transitions. [2024-10-13 11:49:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3113 transitions. [2024-10-13 11:49:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:49:25,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:25,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:49:25,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:49:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:25,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:25,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1132525186, now seen corresponding path program 1 times [2024-10-13 11:49:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507629496] [2024-10-13 11:49:25,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:25,358 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-13 11:49:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:25,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:49:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:25,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:49:25,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:25,585 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-13 11:49:25,595 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-13 11:49:25,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:49:25,667 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-13 11:49:25,690 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:49:25,691 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-13 11:49:25,717 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-13 11:49:25,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:25,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:25,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507629496] [2024-10-13 11:49:25,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507629496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:25,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:25,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:49:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417344908] [2024-10-13 11:49:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:25,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:25,720 INFO L87 Difference]: Start difference. First operand 2383 states and 3113 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:33,212 INFO L93 Difference]: Finished difference Result 4425 states and 5305 transitions. [2024-10-13 11:49:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:49:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:49:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:33,229 INFO L225 Difference]: With dead ends: 4425 [2024-10-13 11:49:33,229 INFO L226 Difference]: Without dead ends: 4425 [2024-10-13 11:49:33,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:33,232 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 2161 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:33,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2091 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-13 11:49:33,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2024-10-13 11:49:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2957. [2024-10-13 11:49:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1985 states have (on average 2.234256926952141) internal successors, (4435), 2932 states have internal predecessors, (4435), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4485 transitions. [2024-10-13 11:49:33,306 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4485 transitions. Word has length 6 [2024-10-13 11:49:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:33,308 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4485 transitions. [2024-10-13 11:49:33,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4485 transitions. [2024-10-13 11:49:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:49:33,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:33,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:33,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 11:49:33,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:33,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:33,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash -748542378, now seen corresponding path program 1 times [2024-10-13 11:49:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054422619] [2024-10-13 11:49:33,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:33,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:33,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:49:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:33,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:49:33,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:33,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:49:33,704 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-13 11:49:33,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:33,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054422619] [2024-10-13 11:49:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054422619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:49:33,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463230401] [2024-10-13 11:49:33,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:33,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:33,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:33,706 INFO L87 Difference]: Start difference. First operand 2957 states and 4485 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:36,731 INFO L93 Difference]: Finished difference Result 3593 states and 5079 transitions. [2024-10-13 11:49:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:49:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:36,747 INFO L225 Difference]: With dead ends: 3593 [2024-10-13 11:49:36,747 INFO L226 Difference]: Without dead ends: 3593 [2024-10-13 11:49:36,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:36,750 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 1726 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:36,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2154 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 11:49:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-10-13 11:49:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2865. [2024-10-13 11:49:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 1985 states have (on average 2.1259445843828715) internal successors, (4220), 2840 states have internal predecessors, (4220), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4270 transitions. [2024-10-13 11:49:36,823 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4270 transitions. Word has length 7 [2024-10-13 11:49:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 4270 transitions. [2024-10-13 11:49:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4270 transitions. [2024-10-13 11:49:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:49:36,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:36,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:36,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 11:49:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:37,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:37,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash -748542377, now seen corresponding path program 1 times [2024-10-13 11:49:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112392322] [2024-10-13 11:49:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:37,028 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-13 11:49:37,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:37,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:37,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:49:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:37,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:49:37,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:37,194 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-13 11:49:37,215 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-13 11:49:37,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:37,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:37,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112392322] [2024-10-13 11:49:37,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112392322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:37,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:37,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:49:37,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128468058] [2024-10-13 11:49:37,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:37,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:37,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:37,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:37,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:37,217 INFO L87 Difference]: Start difference. First operand 2865 states and 4270 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:40,816 INFO L93 Difference]: Finished difference Result 4436 states and 6495 transitions. [2024-10-13 11:49:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:49:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:40,831 INFO L225 Difference]: With dead ends: 4436 [2024-10-13 11:49:40,831 INFO L226 Difference]: Without dead ends: 4436 [2024-10-13 11:49:40,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:40,832 INFO L432 NwaCegarLoop]: 1961 mSDtfsCounter, 1287 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:40,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2788 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 11:49:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-10-13 11:49:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3133. [2024-10-13 11:49:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2263 states have (on average 2.114007954043305) internal successors, (4784), 3108 states have internal predecessors, (4784), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4834 transitions. [2024-10-13 11:49:40,902 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4834 transitions. Word has length 7 [2024-10-13 11:49:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:40,902 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4834 transitions. [2024-10-13 11:49:40,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4834 transitions. [2024-10-13 11:49:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:49:40,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:40,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:40,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 11:49:41,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:41,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:41,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1658779517, now seen corresponding path program 1 times [2024-10-13 11:49:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191341241] [2024-10-13 11:49:41,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:41,106 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-13 11:49:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:41,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:41,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:49:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:41,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:49:41,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:41,292 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-13 11:49:41,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:41,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:41,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191341241] [2024-10-13 11:49:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191341241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:41,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:41,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:49:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536377355] [2024-10-13 11:49:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:41,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:41,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:41,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:41,295 INFO L87 Difference]: Start difference. First operand 3133 states and 4834 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:42,117 INFO L93 Difference]: Finished difference Result 3079 states and 4754 transitions. [2024-10-13 11:49:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 11:49:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:42,124 INFO L225 Difference]: With dead ends: 3079 [2024-10-13 11:49:42,124 INFO L226 Difference]: Without dead ends: 3079 [2024-10-13 11:49:42,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:42,125 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 61 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:42,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3216 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:49:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2024-10-13 11:49:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3079. [2024-10-13 11:49:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 2233 states have (on average 2.1065830721003134) internal successors, (4704), 3054 states have internal predecessors, (4704), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4754 transitions. [2024-10-13 11:49:42,173 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4754 transitions. Word has length 10 [2024-10-13 11:49:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:42,173 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 4754 transitions. [2024-10-13 11:49:42,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4754 transitions. [2024-10-13 11:49:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:49:42,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:42,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:42,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 11:49:42,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:42,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:42,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -654195427, now seen corresponding path program 1 times [2024-10-13 11:49:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381452518] [2024-10-13 11:49:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:42,376 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-13 11:49:42,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:42,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:42,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:49:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:42,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:49:42,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:42,549 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-13 11:49:42,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:42,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:42,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381452518] [2024-10-13 11:49:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381452518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:49:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837804476] [2024-10-13 11:49:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:42,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:42,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:42,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:42,551 INFO L87 Difference]: Start difference. First operand 3079 states and 4754 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 11:49:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:43,727 INFO L93 Difference]: Finished difference Result 3063 states and 4710 transitions. [2024-10-13 11:49:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:49:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 11:49:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:43,737 INFO L225 Difference]: With dead ends: 3063 [2024-10-13 11:49:43,738 INFO L226 Difference]: Without dead ends: 3063 [2024-10-13 11:49:43,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:49:43,738 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 45 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:43,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4776 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:49:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2024-10-13 11:49:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2024-10-13 11:49:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2231 states have (on average 2.088749439713133) internal successors, (4660), 3038 states have internal predecessors, (4660), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4710 transitions. [2024-10-13 11:49:43,791 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4710 transitions. Word has length 12 [2024-10-13 11:49:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4710 transitions. [2024-10-13 11:49:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-13 11:49:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4710 transitions. [2024-10-13 11:49:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:49:43,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:43,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:43,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 11:49:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:43,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:43,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash -20247634, now seen corresponding path program 1 times [2024-10-13 11:49:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:43,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611911729] [2024-10-13 11:49:43,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:43,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:49:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:44,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:49:44,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:44,230 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-13 11:49:44,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:44,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611911729] [2024-10-13 11:49:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611911729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:49:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41688904] [2024-10-13 11:49:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:44,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:44,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:44,232 INFO L87 Difference]: Start difference. First operand 3063 states and 4710 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:45,155 INFO L93 Difference]: Finished difference Result 2949 states and 4470 transitions. [2024-10-13 11:49:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 11:49:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:45,164 INFO L225 Difference]: With dead ends: 2949 [2024-10-13 11:49:45,164 INFO L226 Difference]: Without dead ends: 2949 [2024-10-13 11:49:45,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-13 11:49:45,165 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 61 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:45,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3100 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:49:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2024-10-13 11:49:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2024-10-13 11:49:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 2.0644558617468474) internal successors, (4420), 2924 states have internal predecessors, (4420), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4470 transitions. [2024-10-13 11:49:45,215 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4470 transitions. Word has length 17 [2024-10-13 11:49:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:45,215 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4470 transitions. [2024-10-13 11:49:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4470 transitions. [2024-10-13 11:49:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:49:45,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:45,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:45,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:49:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:45,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:45,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash 248617070, now seen corresponding path program 1 times [2024-10-13 11:49:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093002714] [2024-10-13 11:49:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:45,422 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-13 11:49:45,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:45,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:45,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:49:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:45,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:49:45,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:45,647 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-13 11:49:45,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:45,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093002714] [2024-10-13 11:49:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093002714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:45,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:49:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312126668] [2024-10-13 11:49:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:49:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:49:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:49:45,650 INFO L87 Difference]: Start difference. First operand 2949 states and 4470 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:46,580 INFO L93 Difference]: Finished difference Result 2895 states and 4390 transitions. [2024-10-13 11:49:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:49:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 11:49:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:46,588 INFO L225 Difference]: With dead ends: 2895 [2024-10-13 11:49:46,588 INFO L226 Difference]: Without dead ends: 2895 [2024-10-13 11:49:46,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-13 11:49:46,588 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 61 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:46,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3026 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:49:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2024-10-13 11:49:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2895. [2024-10-13 11:49:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2111 states have (on average 2.0558976788252012) internal successors, (4340), 2870 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4390 transitions. [2024-10-13 11:49:46,634 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4390 transitions. Word has length 17 [2024-10-13 11:49:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:46,634 INFO L471 AbstractCegarLoop]: Abstraction has 2895 states and 4390 transitions. [2024-10-13 11:49:46,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:49:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4390 transitions. [2024-10-13 11:49:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:49:46,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:46,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:46,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:49:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:46,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2016885832, now seen corresponding path program 1 times [2024-10-13 11:49:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896732789] [2024-10-13 11:49:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:46,837 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-13 11:49:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:46,839 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:46,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:49:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:47,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:49:47,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:47,076 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-13 11:49:47,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:47,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896732789] [2024-10-13 11:49:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896732789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:49:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317286076] [2024-10-13 11:49:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:47,080 INFO L87 Difference]: Start difference. First operand 2895 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 11:49:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:48,244 INFO L93 Difference]: Finished difference Result 2875 states and 4258 transitions. [2024-10-13 11:49:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:49:48,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 11:49:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:48,250 INFO L225 Difference]: With dead ends: 2875 [2024-10-13 11:49:48,250 INFO L226 Difference]: Without dead ends: 2875 [2024-10-13 11:49:48,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-13 11:49:48,251 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 45 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:48,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4491 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:49:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-13 11:49:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2875. [2024-10-13 11:49:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2105 states have (on average 1.9990498812351545) internal successors, (4208), 2850 states have internal predecessors, (4208), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4258 transitions. [2024-10-13 11:49:48,311 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4258 transitions. Word has length 19 [2024-10-13 11:49:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4258 transitions. [2024-10-13 11:49:48,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 11:49:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4258 transitions. [2024-10-13 11:49:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 11:49:48,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:48,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:49:48,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 11:49:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:48,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1597166264, now seen corresponding path program 1 times [2024-10-13 11:49:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266410756] [2024-10-13 11:49:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:48,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:48,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:48,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:48,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:49:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:48,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:49:48,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:49:48,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:48,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266410756] [2024-10-13 11:49:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266410756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:48,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:49:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132845033] [2024-10-13 11:49:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:48,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:48,754 INFO L87 Difference]: Start difference. First operand 2875 states and 4258 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 11:49:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:49,824 INFO L93 Difference]: Finished difference Result 2859 states and 4214 transitions. [2024-10-13 11:49:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:49:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 11:49:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:49,832 INFO L225 Difference]: With dead ends: 2859 [2024-10-13 11:49:49,832 INFO L226 Difference]: Without dead ends: 2859 [2024-10-13 11:49:49,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-13 11:49:49,833 INFO L432 NwaCegarLoop]: 1482 mSDtfsCounter, 45 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:49,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4428 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:49:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-13 11:49:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2024-10-13 11:49:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2103 states have (on average 1.9800285306704708) internal successors, (4164), 2834 states have internal predecessors, (4164), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4214 transitions. [2024-10-13 11:49:49,885 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4214 transitions. Word has length 19 [2024-10-13 11:49:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4214 transitions. [2024-10-13 11:49:49,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 11:49:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4214 transitions. [2024-10-13 11:49:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:49:49,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:49,888 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] [2024-10-13 11:49:49,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:49:50,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:50,088 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:50,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -381678773, now seen corresponding path program 1 times [2024-10-13 11:49:50,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747819853] [2024-10-13 11:49:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:50,091 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-13 11:49:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:50,094 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:50,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:49:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:50,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:49:50,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:50,276 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-13 11:49:50,333 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-13 11:49:50,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:50,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:50,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747819853] [2024-10-13 11:49:50,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747819853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:50,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:49:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566705005] [2024-10-13 11:49:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:50,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:50,336 INFO L87 Difference]: Start difference. First operand 2859 states and 4214 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 11:49:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:53,199 INFO L93 Difference]: Finished difference Result 3113 states and 4366 transitions. [2024-10-13 11:49:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:49:53,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 11:49:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:53,206 INFO L225 Difference]: With dead ends: 3113 [2024-10-13 11:49:53,206 INFO L226 Difference]: Without dead ends: 3113 [2024-10-13 11:49:53,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-13 11:49:53,207 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 1489 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:53,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 2065 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:49:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-10-13 11:49:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2855. [2024-10-13 11:49:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2103 states have (on average 1.97622444127437) internal successors, (4156), 2830 states have internal predecessors, (4156), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4206 transitions. [2024-10-13 11:49:53,250 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4206 transitions. Word has length 26 [2024-10-13 11:49:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:53,250 INFO L471 AbstractCegarLoop]: Abstraction has 2855 states and 4206 transitions. [2024-10-13 11:49:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 11:49:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4206 transitions. [2024-10-13 11:49:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:49:53,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:53,252 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] [2024-10-13 11:49:53,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 11:49:53,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:53,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:53,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -381678772, now seen corresponding path program 1 times [2024-10-13 11:49:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558682127] [2024-10-13 11:49:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:53,454 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-13 11:49:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:53,457 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:53,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:49:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:53,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:49:53,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:53,663 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-13 11:49:53,819 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-13 11:49:53,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:53,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558682127] [2024-10-13 11:49:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558682127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:49:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044710884] [2024-10-13 11:49:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:53,821 INFO L87 Difference]: Start difference. First operand 2855 states and 4206 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 11:49:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:49:57,554 INFO L93 Difference]: Finished difference Result 3523 states and 4946 transitions. [2024-10-13 11:49:57,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:49:57,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 11:49:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:49:57,561 INFO L225 Difference]: With dead ends: 3523 [2024-10-13 11:49:57,561 INFO L226 Difference]: Without dead ends: 3523 [2024-10-13 11:49:57,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-13 11:49:57,562 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 737 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:49:57,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2879 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 11:49:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-13 11:49:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2888. [2024-10-13 11:49:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2136 states have (on average 1.9634831460674158) internal successors, (4194), 2863 states have internal predecessors, (4194), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:49:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4244 transitions. [2024-10-13 11:49:57,604 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4244 transitions. Word has length 26 [2024-10-13 11:49:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:49:57,604 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4244 transitions. [2024-10-13 11:49:57,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-13 11:49:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4244 transitions. [2024-10-13 11:49:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:49:57,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:49:57,607 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] [2024-10-13 11:49:57,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:49:57,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:57,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:49:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:49:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash -539382154, now seen corresponding path program 1 times [2024-10-13 11:49:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:49:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439580729] [2024-10-13 11:49:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:49:57,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:49:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:49:57,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:49:57,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:49:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:49:57,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:49:57,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:49:58,002 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-13 11:49:58,054 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-13 11:49:58,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:49:58,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:49:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439580729] [2024-10-13 11:49:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439580729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:49:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:49:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:49:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779460741] [2024-10-13 11:49:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:49:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:49:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:49:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:49:58,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:49:58,056 INFO L87 Difference]: Start difference. First operand 2888 states and 4244 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:00,818 INFO L93 Difference]: Finished difference Result 3541 states and 4945 transitions. [2024-10-13 11:50:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:50:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 11:50:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:00,824 INFO L225 Difference]: With dead ends: 3541 [2024-10-13 11:50:00,824 INFO L226 Difference]: Without dead ends: 3541 [2024-10-13 11:50:00,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 11:50:00,824 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1526 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:00,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3175 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 11:50:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2024-10-13 11:50:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2884. [2024-10-13 11:50:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.952247191011236) internal successors, (4170), 2859 states have internal predecessors, (4170), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:50:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4220 transitions. [2024-10-13 11:50:00,863 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4220 transitions. Word has length 33 [2024-10-13 11:50:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4220 transitions. [2024-10-13 11:50:00,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4220 transitions. [2024-10-13 11:50:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:50:00,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:00,865 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] [2024-10-13 11:50:00,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 11:50:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:01,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -539382153, now seen corresponding path program 1 times [2024-10-13 11:50:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615662012] [2024-10-13 11:50:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:01,066 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-13 11:50:01,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:01,070 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:01,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:50:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:01,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:50:01,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:50:01,458 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-13 11:50:01,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:01,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615662012] [2024-10-13 11:50:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615662012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:50:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333685548] [2024-10-13 11:50:01,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:01,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:50:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:50:01,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:50:01,460 INFO L87 Difference]: Start difference. First operand 2884 states and 4220 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:05,621 INFO L93 Difference]: Finished difference Result 4075 states and 5749 transitions. [2024-10-13 11:50:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:50:05,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 11:50:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:05,627 INFO L225 Difference]: With dead ends: 4075 [2024-10-13 11:50:05,627 INFO L226 Difference]: Without dead ends: 4075 [2024-10-13 11:50:05,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 11:50:05,627 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 1083 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:05,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3806 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 11:50:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2024-10-13 11:50:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2884. [2024-10-13 11:50:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.948501872659176) internal successors, (4162), 2859 states have internal predecessors, (4162), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:50:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4212 transitions. [2024-10-13 11:50:05,668 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4212 transitions. Word has length 33 [2024-10-13 11:50:05,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:05,668 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4212 transitions. [2024-10-13 11:50:05,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4212 transitions. [2024-10-13 11:50:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:50:05,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:05,669 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] [2024-10-13 11:50:05,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:50:05,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:05,874 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:05,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:05,874 INFO L85 PathProgramCache]: Analyzing trace with hash -514220746, now seen corresponding path program 1 times [2024-10-13 11:50:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116272185] [2024-10-13 11:50:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:05,875 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-13 11:50:05,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:05,876 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:05,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:50:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:06,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:50:06,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:06,069 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-13 11:50:06,142 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-13 11:50:06,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:06,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116272185] [2024-10-13 11:50:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116272185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:06,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:06,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:50:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713627157] [2024-10-13 11:50:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:06,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:50:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:50:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:50:06,144 INFO L87 Difference]: Start difference. First operand 2884 states and 4212 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:08,923 INFO L93 Difference]: Finished difference Result 3521 states and 4913 transitions. [2024-10-13 11:50:08,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:50:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 11:50:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:08,927 INFO L225 Difference]: With dead ends: 3521 [2024-10-13 11:50:08,927 INFO L226 Difference]: Without dead ends: 3521 [2024-10-13 11:50:08,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 11:50:08,928 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1522 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:08,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3175 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 11:50:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-10-13 11:50:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2880. [2024-10-13 11:50:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2136 states have (on average 1.9447565543071161) internal successors, (4154), 2855 states have internal predecessors, (4154), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:50:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4204 transitions. [2024-10-13 11:50:08,973 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4204 transitions. Word has length 33 [2024-10-13 11:50:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:08,974 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4204 transitions. [2024-10-13 11:50:08,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4204 transitions. [2024-10-13 11:50:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 11:50:08,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:08,975 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] [2024-10-13 11:50:08,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:50:09,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:09,176 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:09,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash -514220745, now seen corresponding path program 1 times [2024-10-13 11:50:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23619202] [2024-10-13 11:50:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:09,177 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-13 11:50:09,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:09,180 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:09,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:50:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:09,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:50:09,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:09,415 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-13 11:50:09,552 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-13 11:50:09,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:09,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:09,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23619202] [2024-10-13 11:50:09,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23619202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:09,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:50:09,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124367346] [2024-10-13 11:50:09,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:09,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:50:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:50:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:50:09,556 INFO L87 Difference]: Start difference. First operand 2880 states and 4204 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:13,861 INFO L93 Difference]: Finished difference Result 4067 states and 5733 transitions. [2024-10-13 11:50:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:50:13,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 11:50:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:13,865 INFO L225 Difference]: With dead ends: 4067 [2024-10-13 11:50:13,865 INFO L226 Difference]: Without dead ends: 4067 [2024-10-13 11:50:13,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-13 11:50:13,865 INFO L432 NwaCegarLoop]: 1799 mSDtfsCounter, 1075 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:13,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 3771 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 11:50:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-10-13 11:50:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2876. [2024-10-13 11:50:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2136 states have (on average 1.9410112359550562) internal successors, (4146), 2851 states have internal predecessors, (4146), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:50:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4196 transitions. [2024-10-13 11:50:13,898 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4196 transitions. Word has length 33 [2024-10-13 11:50:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:13,898 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4196 transitions. [2024-10-13 11:50:13,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-13 11:50:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4196 transitions. [2024-10-13 11:50:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 11:50:13,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:13,899 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] [2024-10-13 11:50:13,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 11:50:14,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:14,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:14,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1343686139, now seen corresponding path program 1 times [2024-10-13 11:50:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:14,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251733646] [2024-10-13 11:50:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:14,105 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-13 11:50:14,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:14,106 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:14,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:50:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:14,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:50:14,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:14,306 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-13 11:50:14,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:14,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251733646] [2024-10-13 11:50:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251733646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:14,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:50:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736354700] [2024-10-13 11:50:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:50:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:50:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:50:14,308 INFO L87 Difference]: Start difference. First operand 2876 states and 4196 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 11:50:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:15,281 INFO L93 Difference]: Finished difference Result 2864 states and 4172 transitions. [2024-10-13 11:50:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:50:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-13 11:50:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:15,286 INFO L225 Difference]: With dead ends: 2864 [2024-10-13 11:50:15,286 INFO L226 Difference]: Without dead ends: 2864 [2024-10-13 11:50:15,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-13 11:50:15,287 INFO L432 NwaCegarLoop]: 1468 mSDtfsCounter, 21 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4381 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:15,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4381 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:50:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2024-10-13 11:50:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2024-10-13 11:50:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2124 states have (on average 1.9406779661016949) internal successors, (4122), 2839 states have internal predecessors, (4122), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:50:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4172 transitions. [2024-10-13 11:50:15,338 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4172 transitions. Word has length 40 [2024-10-13 11:50:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:15,338 INFO L471 AbstractCegarLoop]: Abstraction has 2864 states and 4172 transitions. [2024-10-13 11:50:15,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 11:50:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4172 transitions. [2024-10-13 11:50:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 11:50:15,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:15,339 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] [2024-10-13 11:50:15,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-13 11:50:15,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:15,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:15,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2088153858, now seen corresponding path program 1 times [2024-10-13 11:50:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:15,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457430423] [2024-10-13 11:50:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:15,542 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-13 11:50:15,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:15,543 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:15,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:50:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:15,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:50:15,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:15,894 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-13 11:50:15,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:15,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457430423] [2024-10-13 11:50:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457430423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:50:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317799204] [2024-10-13 11:50:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:50:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:15,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:50:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:50:15,896 INFO L87 Difference]: Start difference. First operand 2864 states and 4172 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-13 11:50:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:50:17,005 INFO L93 Difference]: Finished difference Result 4172 states and 5857 transitions. [2024-10-13 11:50:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:50:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-10-13 11:50:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:50:17,010 INFO L225 Difference]: With dead ends: 4172 [2024-10-13 11:50:17,010 INFO L226 Difference]: Without dead ends: 4172 [2024-10-13 11:50:17,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 11:50:17,010 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 1014 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:50:17,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2906 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:50:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2024-10-13 11:50:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 3536. [2024-10-13 11:50:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 2792 states have (on average 1.9255014326647564) internal successors, (5376), 3504 states have internal predecessors, (5376), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 11:50:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5440 transitions. [2024-10-13 11:50:17,042 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5440 transitions. Word has length 44 [2024-10-13 11:50:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:50:17,042 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5440 transitions. [2024-10-13 11:50:17,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-13 11:50:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5440 transitions. [2024-10-13 11:50:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:50:17,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:50:17,044 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] [2024-10-13 11:50:17,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 11:50:17,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:50:17,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 11:50:17,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:50:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1373428208, now seen corresponding path program 1 times [2024-10-13 11:50:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:50:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716600701] [2024-10-13 11:50:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:50:17,247 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-13 11:50:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:50:17,250 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:50:17,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:50:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:50:17,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:50:17,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:50:17,582 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-13 11:50:17,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:50:17,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:50:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716600701] [2024-10-13 11:50:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716600701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:50:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:50:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:50:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075169060] [2024-10-13 11:50:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:50:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:50:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:50:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:50:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:50:17,585 INFO L87 Difference]: Start difference. First operand 3536 states and 5440 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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)