./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:17:50,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:17:50,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:17:50,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:17:50,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:17:50,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:17:50,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:17:50,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:17:50,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:17:50,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:17:50,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:17:50,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:17:50,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:17:50,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:17:50,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:17:50,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:17:50,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:17:50,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:17:50,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:17:50,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:17:50,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:17:50,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:17:50,770 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:17:50,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:17:50,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:17:50,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:17:50,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:17:50,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:17:50,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:17:50,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:17:50,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:17:50,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:17:50,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:17:50,773 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-memcleanup) ) 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2024-11-09 07:17:50,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:17:51,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:17:51,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:17:51,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:17:51,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:17:51,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-09 07:17:52,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:17:52,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:17:52,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-09 07:17:52,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad372d79/483fb34f86b94bcc931eec3ac697ae65/FLAGf6e854d49 [2024-11-09 07:17:52,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad372d79/483fb34f86b94bcc931eec3ac697ae65 [2024-11-09 07:17:52,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:17:52,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:17:52,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:52,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:17:52,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:17:52,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:52" (1/1) ... [2024-11-09 07:17:52,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52028e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:52, skipping insertion in model container [2024-11-09 07:17:52,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:52" (1/1) ... [2024-11-09 07:17:52,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:17:53,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,289 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,293 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,301 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,335 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,337 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,339 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,340 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,342 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,344 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,347 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,353 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:53,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:53,379 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-11-09 07:17:53,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6aebce89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:53, skipping insertion in model container [2024-11-09 07:17:53,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:53,380 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:17:53,382 INFO L158 Benchmark]: Toolchain (without parser) took 599.02ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 66.7MB in the beginning and 153.3MB in the end (delta: -86.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-09 07:17:53,382 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:17:53,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.72ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 66.5MB in the beginning and 153.3MB in the end (delta: -86.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-09 07:17:53,384 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.16ms. Allocated memory is still 142.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.72ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 66.5MB in the beginning and 153.3MB in the end (delta: -86.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:17:54,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:17:55,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:17:55,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:17:55,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:17:55,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:17:55,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:17:55,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:17:55,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:17:55,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:17:55,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:17:55,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:17:55,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:17:55,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:17:55,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:17:55,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:17:55,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:17:55,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:17:55,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:17:55,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:17:55,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:17:55,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:17:55,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:17:55,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:17:55,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:17:55,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:17:55,068 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:17:55,068 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:17:55,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:17:55,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:17:55,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:17:55,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:17:55,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:17:55,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:17:55,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:17:55,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:17:55,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:17:55,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:17:55,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:17:55,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:17:55,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:17:55,074 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:17:55,074 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:17:55,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:17:55,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:17:55,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:17:55,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:17:55,075 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-memcleanup) ) 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2024-11-09 07:17:55,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:17:55,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:17:55,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:17:55,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:17:55,333 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:17:55,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-09 07:17:56,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:17:56,899 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:17:56,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-09 07:17:56,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfcedb5/6dd2b9fbf85a4ae2b539391b5731b2f1/FLAGffca89d31 [2024-11-09 07:17:56,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfcedb5/6dd2b9fbf85a4ae2b539391b5731b2f1 [2024-11-09 07:17:56,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:17:56,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:17:56,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:56,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:17:56,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:17:56,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:56" (1/1) ... [2024-11-09 07:17:56,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb1d2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:56, skipping insertion in model container [2024-11-09 07:17:56,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:56" (1/1) ... [2024-11-09 07:17:57,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:17:57,356 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,383 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,385 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,399 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,427 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,429 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,430 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,432 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,441 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,446 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:57,460 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:17:57,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:17:57,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,517 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,519 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,524 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,527 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,542 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,543 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,544 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,544 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,546 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,547 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,548 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,548 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,550 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:17:57,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:57,560 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:17:57,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:57,723 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:17:57,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57 WrapperNode [2024-11-09 07:17:57,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:57,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:17:57,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:17:57,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:17:57,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,821 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1071 [2024-11-09 07:17:57,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:17:57,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:17:57,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:17:57,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:17:57,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,896 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2024-11-09 07:17:57,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:17:57,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:17:57,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:17:57,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:17:57,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (1/1) ... [2024-11-09 07:17:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:17:57,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:17:57,978 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-11-09 07:17:57,981 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-11-09 07:17:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:17:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:17:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:17:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:17:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:17:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 07:17:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:17:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:17:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:17:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 07:17:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 07:17:58,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-09 07:17:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:17:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-09 07:17:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-09 07:17:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-09 07:17:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:17:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:17:58,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:17:58,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:18:01,978 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-09 07:18:01,978 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:18:01,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:18:01,999 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 07:18:02,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:02 BoogieIcfgContainer [2024-11-09 07:18:02,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:18:02,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:18:02,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:18:02,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:18:02,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:17:56" (1/3) ... [2024-11-09 07:18:02,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8caab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:02, skipping insertion in model container [2024-11-09 07:18:02,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:57" (2/3) ... [2024-11-09 07:18:02,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8caab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:02, skipping insertion in model container [2024-11-09 07:18:02,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:02" (3/3) ... [2024-11-09 07:18:02,008 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2024-11-09 07:18:02,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:18:02,021 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:18:02,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:18:02,065 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;@627bc09b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:18:02,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:18:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 07:18:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:18:02,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:02,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:02,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:02,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1647619846, now seen corresponding path program 1 times [2024-11-09 07:18:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168600159] [2024-11-09 07:18:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:02,097 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-11-09 07:18:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:02,100 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-11-09 07:18:02,104 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-11-09 07:18:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:02,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:18:02,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:02,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:02,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:02,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168600159] [2024-11-09 07:18:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168600159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:02,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:18:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189859060] [2024-11-09 07:18:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:18:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:18:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:18:02,330 INFO L87 Difference]: Start difference. First operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:02,351 INFO L93 Difference]: Finished difference Result 229 states and 294 transitions. [2024-11-09 07:18:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:18:02,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:18:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:02,359 INFO L225 Difference]: With dead ends: 229 [2024-11-09 07:18:02,359 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 07:18:02,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:18:02,362 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:02,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 07:18:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-09 07:18:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 204 states have (on average 1.2843137254901962) internal successors, (262), 209 states have internal predecessors, (262), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:18:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2024-11-09 07:18:02,399 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 10 [2024-11-09 07:18:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2024-11-09 07:18:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2024-11-09 07:18:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:18:02,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:02,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:02,407 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-11-09 07:18:02,601 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-11-09 07:18:02,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash -617467811, now seen corresponding path program 1 times [2024-11-09 07:18:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539308234] [2024-11-09 07:18:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:02,603 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-11-09 07:18:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:02,604 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-11-09 07:18:02,605 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-11-09 07:18:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:02,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:18:02,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:02,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:02,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539308234] [2024-11-09 07:18:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539308234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:02,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:02,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980173104] [2024-11-09 07:18:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:02,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:02,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:02,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:02,833 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:05,240 INFO L93 Difference]: Finished difference Result 343 states and 444 transitions. [2024-11-09 07:18:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:18:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:18:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:05,244 INFO L225 Difference]: With dead ends: 343 [2024-11-09 07:18:05,244 INFO L226 Difference]: Without dead ends: 343 [2024-11-09 07:18:05,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:05,245 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 139 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:05,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 791 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 07:18:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-09 07:18:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2024-11-09 07:18:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 316 states have (on average 1.2943037974683544) internal successors, (409), 321 states have internal predecessors, (409), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:18:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 439 transitions. [2024-11-09 07:18:05,264 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 439 transitions. Word has length 12 [2024-11-09 07:18:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:05,267 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 439 transitions. [2024-11-09 07:18:05,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 439 transitions. [2024-11-09 07:18:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:18:05,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:05,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:05,271 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-11-09 07:18:05,468 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-11-09 07:18:05,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash -559454960, now seen corresponding path program 1 times [2024-11-09 07:18:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003200703] [2024-11-09 07:18:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:05,470 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-11-09 07:18:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:05,473 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-11-09 07:18:05,474 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-11-09 07:18:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:05,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:18:05,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:05,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:05,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:05,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:18:05,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:05,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:18:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:05,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:05,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003200703] [2024-11-09 07:18:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003200703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623826683] [2024-11-09 07:18:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:05,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:05,703 INFO L87 Difference]: Start difference. First operand 339 states and 439 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:06,072 INFO L93 Difference]: Finished difference Result 519 states and 679 transitions. [2024-11-09 07:18:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:18:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:18:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:06,075 INFO L225 Difference]: With dead ends: 519 [2024-11-09 07:18:06,075 INFO L226 Difference]: Without dead ends: 519 [2024-11-09 07:18:06,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:06,076 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 230 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:06,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 824 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-09 07:18:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 338. [2024-11-09 07:18:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 315 states have (on average 1.2920634920634921) internal successors, (407), 320 states have internal predecessors, (407), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:18:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2024-11-09 07:18:06,088 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 15 [2024-11-09 07:18:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:06,088 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2024-11-09 07:18:06,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2024-11-09 07:18:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:18:06,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:06,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:06,095 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-11-09 07:18:06,290 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-11-09 07:18:06,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:06,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:06,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1940751512, now seen corresponding path program 1 times [2024-11-09 07:18:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:06,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995186051] [2024-11-09 07:18:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:06,291 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-11-09 07:18:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:06,294 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-11-09 07:18:06,295 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-11-09 07:18:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:06,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:18:06,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:06,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:06,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995186051] [2024-11-09 07:18:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995186051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169398502] [2024-11-09 07:18:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:06,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:06,555 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:06,635 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2024-11-09 07:18:06,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 07:18:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:06,637 INFO L225 Difference]: With dead ends: 344 [2024-11-09 07:18:06,637 INFO L226 Difference]: Without dead ends: 344 [2024-11-09 07:18:06,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:06,638 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:06,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 767 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-09 07:18:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-09 07:18:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 321 states have (on average 1.236760124610592) internal successors, (397), 326 states have internal predecessors, (397), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:18:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2024-11-09 07:18:06,647 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 427 transitions. Word has length 50 [2024-11-09 07:18:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:06,647 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 427 transitions. [2024-11-09 07:18:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 427 transitions. [2024-11-09 07:18:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:18:06,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:06,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:06,656 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-11-09 07:18:06,849 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-11-09 07:18:06,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:06,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1486167460, now seen corresponding path program 1 times [2024-11-09 07:18:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:06,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252247589] [2024-11-09 07:18:06,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:06,850 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-11-09 07:18:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:06,851 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-11-09 07:18:06,852 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-11-09 07:18:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:07,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:18:07,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:07,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:07,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252247589] [2024-11-09 07:18:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252247589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:18:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342802304] [2024-11-09 07:18:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:18:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:18:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:07,086 INFO L87 Difference]: Start difference. First operand 344 states and 427 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:07,155 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2024-11-09 07:18:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 07:18:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:07,157 INFO L225 Difference]: With dead ends: 354 [2024-11-09 07:18:07,157 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 07:18:07,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:07,158 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 9 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:07,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1371 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 07:18:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-09 07:18:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.2347560975609757) internal successors, (405), 334 states have internal predecessors, (405), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 07:18:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2024-11-09 07:18:07,166 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 50 [2024-11-09 07:18:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:07,167 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2024-11-09 07:18:07,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2024-11-09 07:18:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 07:18:07,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:07,168 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:07,176 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-11-09 07:18:07,372 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-11-09 07:18:07,373 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:07,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1102378676, now seen corresponding path program 1 times [2024-11-09 07:18:07,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:07,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442008624] [2024-11-09 07:18:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:07,374 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-11-09 07:18:07,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:07,377 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-11-09 07:18:07,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 (7)] Waiting until timeout for monitored process [2024-11-09 07:18:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:07,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:18:07,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:07,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:07,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442008624] [2024-11-09 07:18:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442008624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:07,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:07,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075870187] [2024-11-09 07:18:07,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:07,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:18:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:18:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:07,755 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:18:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:07,900 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-09 07:18:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:18:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-09 07:18:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:07,903 INFO L225 Difference]: With dead ends: 362 [2024-11-09 07:18:07,903 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 07:18:07,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:07,904 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 20 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:07,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 990 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 07:18:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-11-09 07:18:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 330 states have (on average 1.2333333333333334) internal successors, (407), 337 states have internal predecessors, (407), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-09 07:18:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 442 transitions. [2024-11-09 07:18:07,912 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 442 transitions. Word has length 65 [2024-11-09 07:18:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:07,912 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 442 transitions. [2024-11-09 07:18:07,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:18:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 442 transitions. [2024-11-09 07:18:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 07:18:07,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:07,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:07,922 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-11-09 07:18:08,114 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-11-09 07:18:08,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:08,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1344249161, now seen corresponding path program 1 times [2024-11-09 07:18:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872405874] [2024-11-09 07:18:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:08,116 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-11-09 07:18:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:08,117 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-11-09 07:18:08,118 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-11-09 07:18:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:08,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:18:08,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:08,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:08,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:08,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872405874] [2024-11-09 07:18:08,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872405874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:08,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:08,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:08,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236283604] [2024-11-09 07:18:08,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:08,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:08,433 INFO L87 Difference]: Start difference. First operand 358 states and 442 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:18:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:08,466 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-09 07:18:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:18:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-09 07:18:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:08,469 INFO L225 Difference]: With dead ends: 362 [2024-11-09 07:18:08,469 INFO L226 Difference]: Without dead ends: 362 [2024-11-09 07:18:08,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:08,470 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:08,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:18:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-09 07:18:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-09 07:18:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 333 states have (on average 1.2342342342342343) internal successors, (411), 341 states have internal predecessors, (411), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-09 07:18:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 447 transitions. [2024-11-09 07:18:08,482 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 447 transitions. Word has length 70 [2024-11-09 07:18:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 447 transitions. [2024-11-09 07:18:08,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:18:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 447 transitions. [2024-11-09 07:18:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 07:18:08,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:08,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:08,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:08,686 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-11-09 07:18:08,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash 198026384, now seen corresponding path program 1 times [2024-11-09 07:18:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836228611] [2024-11-09 07:18:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:08,687 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-11-09 07:18:08,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:08,689 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-11-09 07:18:08,689 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-11-09 07:18:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:08,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:18:08,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:09,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:09,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836228611] [2024-11-09 07:18:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836228611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:09,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:18:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759337364] [2024-11-09 07:18:09,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:09,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:18:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:18:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:09,089 INFO L87 Difference]: Start difference. First operand 362 states and 447 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:18:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:09,227 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2024-11-09 07:18:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:18:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-09 07:18:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:09,230 INFO L225 Difference]: With dead ends: 375 [2024-11-09 07:18:09,230 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 07:18:09,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:18:09,231 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 4 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:09,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1642 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 07:18:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2024-11-09 07:18:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 342 states have (on average 1.2456140350877194) internal successors, (426), 350 states have internal predecessors, (426), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-09 07:18:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2024-11-09 07:18:09,238 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 71 [2024-11-09 07:18:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:09,238 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2024-11-09 07:18:09,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:18:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2024-11-09 07:18:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 07:18:09,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:09,239 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:09,248 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-11-09 07:18:09,443 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-11-09 07:18:09,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash -502361865, now seen corresponding path program 2 times [2024-11-09 07:18:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408778060] [2024-11-09 07:18:09,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:18:09,445 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-11-09 07:18:09,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:09,447 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-11-09 07:18:09,448 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-11-09 07:18:09,917 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:18:09,918 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:09,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:18:09,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:18:10,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 07:18:10,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408778060] [2024-11-09 07:18:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408778060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:10,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:10,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 07:18:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503372143] [2024-11-09 07:18:10,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:10,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:18:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:18:10,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:18:10,235 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:18:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:11,318 INFO L93 Difference]: Finished difference Result 2726 states and 3450 transitions. [2024-11-09 07:18:11,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:18:11,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-09 07:18:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:11,327 INFO L225 Difference]: With dead ends: 2726 [2024-11-09 07:18:11,329 INFO L226 Difference]: Without dead ends: 2726 [2024-11-09 07:18:11,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:18:11,333 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2331 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:11,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 5669 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:18:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-09 07:18:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1887. [2024-11-09 07:18:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1793 states have (on average 1.2576687116564418) internal successors, (2255), 1807 states have internal predecessors, (2255), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-09 07:18:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2375 transitions. [2024-11-09 07:18:11,367 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2375 transitions. Word has length 74 [2024-11-09 07:18:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2375 transitions. [2024-11-09 07:18:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:18:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2375 transitions. [2024-11-09 07:18:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 07:18:11,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:11,369 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:11,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:11,569 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-11-09 07:18:11,570 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1616929423, now seen corresponding path program 1 times [2024-11-09 07:18:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207007872] [2024-11-09 07:18:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:11,572 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-11-09 07:18:11,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:11,574 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-11-09 07:18:11,575 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-11-09 07:18:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:11,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:18:11,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:18:12,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 07:18:12,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:12,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207007872] [2024-11-09 07:18:12,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207007872] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:12,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:12,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:18:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066174526] [2024-11-09 07:18:12,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:18:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:18:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:18:12,289 INFO L87 Difference]: Start difference. First operand 1887 states and 2375 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 07:18:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:12,805 INFO L93 Difference]: Finished difference Result 1977 states and 2500 transitions. [2024-11-09 07:18:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:18:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-09 07:18:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:12,811 INFO L225 Difference]: With dead ends: 1977 [2024-11-09 07:18:12,811 INFO L226 Difference]: Without dead ends: 1947 [2024-11-09 07:18:12,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:18:12,812 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 7 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:12,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2732 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-09 07:18:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1932. [2024-11-09 07:18:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1838 states have (on average 1.2595212187159956) internal successors, (2315), 1852 states have internal predecessors, (2315), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-09 07:18:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2435 transitions. [2024-11-09 07:18:12,840 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2435 transitions. Word has length 110 [2024-11-09 07:18:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2435 transitions. [2024-11-09 07:18:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 07:18:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2435 transitions. [2024-11-09 07:18:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 07:18:12,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:12,841 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:12,857 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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:13,042 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-11-09 07:18:13,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:13,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1059147878, now seen corresponding path program 2 times [2024-11-09 07:18:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586383709] [2024-11-09 07:18:13,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:18:13,044 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-11-09 07:18:13,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:13,046 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-11-09 07:18:13,047 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-11-09 07:18:13,306 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:18:13,307 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:13,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:18:13,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:13,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:13,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:13,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:18:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:18:13,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:13,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:18:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-09 07:18:13,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:13,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586383709] [2024-11-09 07:18:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586383709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978288390] [2024-11-09 07:18:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:13,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:13,362 INFO L87 Difference]: Start difference. First operand 1932 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 07:18:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:13,687 INFO L93 Difference]: Finished difference Result 2702 states and 3455 transitions. [2024-11-09 07:18:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:18:13,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-09 07:18:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:13,694 INFO L225 Difference]: With dead ends: 2702 [2024-11-09 07:18:13,694 INFO L226 Difference]: Without dead ends: 2702 [2024-11-09 07:18:13,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-11-09 07:18:13,694 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 215 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:13,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 769 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-09 07:18:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1944. [2024-11-09 07:18:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1850 states have (on average 1.2578378378378379) internal successors, (2327), 1864 states have internal predecessors, (2327), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-09 07:18:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2447 transitions. [2024-11-09 07:18:13,729 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2447 transitions. Word has length 119 [2024-11-09 07:18:13,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:13,729 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2447 transitions. [2024-11-09 07:18:13,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 07:18:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2447 transitions. [2024-11-09 07:18:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 07:18:13,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:13,731 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:13,736 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-11-09 07:18:13,931 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-11-09 07:18:13,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:13,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1325047018, now seen corresponding path program 1 times [2024-11-09 07:18:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:13,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200214486] [2024-11-09 07:18:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:13,933 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-11-09 07:18:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:13,934 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-11-09 07:18:13,935 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-11-09 07:18:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:14,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:18:14,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 07:18:14,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-09 07:18:15,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200214486] [2024-11-09 07:18:15,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200214486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:15,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:15,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:18:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689748743] [2024-11-09 07:18:15,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:15,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:18:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:18:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:18:15,155 INFO L87 Difference]: Start difference. First operand 1944 states and 2447 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 07:18:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:17,186 INFO L93 Difference]: Finished difference Result 2079 states and 2662 transitions. [2024-11-09 07:18:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:18:17,187 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-09 07:18:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:17,192 INFO L225 Difference]: With dead ends: 2079 [2024-11-09 07:18:17,192 INFO L226 Difference]: Without dead ends: 2049 [2024-11-09 07:18:17,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:18:17,193 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 14 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:17,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3283 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:18:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-09 07:18:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2034. [2024-11-09 07:18:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1940 states have (on average 1.261340206185567) internal successors, (2447), 1954 states have internal predecessors, (2447), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-09 07:18:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2567 transitions. [2024-11-09 07:18:17,222 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2567 transitions. Word has length 126 [2024-11-09 07:18:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:17,222 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2567 transitions. [2024-11-09 07:18:17,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 07:18:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2567 transitions. [2024-11-09 07:18:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 07:18:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:17,223 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:17,240 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:17,424 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-11-09 07:18:17,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:17,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash -951160330, now seen corresponding path program 2 times [2024-11-09 07:18:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:17,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198430928] [2024-11-09 07:18:17,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:18:17,426 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-11-09 07:18:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:17,427 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-11-09 07:18:17,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 (14)] Waiting until timeout for monitored process [2024-11-09 07:18:18,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:18:18,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:18,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:18:18,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 07:18:18,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 07:18:20,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:20,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198430928] [2024-11-09 07:18:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198430928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:20,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:20,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:18:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078489522] [2024-11-09 07:18:20,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:18:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:18:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:18:20,592 INFO L87 Difference]: Start difference. First operand 2034 states and 2567 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 07:18:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:30,074 INFO L93 Difference]: Finished difference Result 2249 states and 2942 transitions. [2024-11-09 07:18:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:18:30,076 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-09 07:18:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:30,081 INFO L225 Difference]: With dead ends: 2249 [2024-11-09 07:18:30,081 INFO L226 Difference]: Without dead ends: 2219 [2024-11-09 07:18:30,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:18:30,083 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 26 mSDsluCounter, 7366 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7643 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:30,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7643 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 07:18:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2024-11-09 07:18:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2204. [2024-11-09 07:18:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2110 states have (on average 1.2687203791469195) internal successors, (2677), 2124 states have internal predecessors, (2677), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-09 07:18:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2797 transitions. [2024-11-09 07:18:30,109 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2797 transitions. Word has length 144 [2024-11-09 07:18:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:30,109 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 2797 transitions. [2024-11-09 07:18:30,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 07:18:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2797 transitions. [2024-11-09 07:18:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 07:18:30,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:30,111 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:30,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:30,311 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-11-09 07:18:30,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1179384982, now seen corresponding path program 3 times [2024-11-09 07:18:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:30,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892873476] [2024-11-09 07:18:30,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:18:30,313 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-11-09 07:18:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:30,314 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-11-09 07:18:30,316 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-11-09 07:18:31,230 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:18:31,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:31,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:18:31,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:31,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-11-09 07:18:31,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-11-09 07:18:31,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-11-09 07:18:31,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:31,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 94 [2024-11-09 07:18:32,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-09 07:18:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-09 07:18:32,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:32,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-11-09 07:18:33,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:33,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-11-09 07:18:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-09 07:18:33,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:33,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892873476] [2024-11-09 07:18:33,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892873476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:33,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 07:18:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068377938] [2024-11-09 07:18:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:33,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:18:33,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:18:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:18:33,197 INFO L87 Difference]: Start difference. First operand 2204 states and 2797 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 07:18:35,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:18:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:42,490 INFO L93 Difference]: Finished difference Result 2788 states and 3549 transitions. [2024-11-09 07:18:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:18:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-09 07:18:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:42,500 INFO L225 Difference]: With dead ends: 2788 [2024-11-09 07:18:42,500 INFO L226 Difference]: Without dead ends: 2773 [2024-11-09 07:18:42,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:18:42,501 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 276 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:42,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 3171 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-09 07:18:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2024-11-09 07:18:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2467. [2024-11-09 07:18:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2364 states have (on average 1.2584602368866329) internal successors, (2975), 2379 states have internal predecessors, (2975), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-09 07:18:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3108 transitions. [2024-11-09 07:18:42,530 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3108 transitions. Word has length 178 [2024-11-09 07:18:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3108 transitions. [2024-11-09 07:18:42,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 07:18:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3108 transitions. [2024-11-09 07:18:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 07:18:42,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:42,532 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:42,548 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-11-09 07:18:42,732 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-11-09 07:18:42,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:42,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:42,733 INFO L85 PathProgramCache]: Analyzing trace with hash 389438833, now seen corresponding path program 4 times [2024-11-09 07:18:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:42,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558951308] [2024-11-09 07:18:42,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:18:42,734 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-11-09 07:18:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:42,737 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-11-09 07:18:42,738 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-11-09 07:18:44,199 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:18:44,199 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:44,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:18:44,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-09 07:18:44,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-09 07:18:44,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558951308] [2024-11-09 07:18:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558951308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:44,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:44,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:18:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880005385] [2024-11-09 07:18:44,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:18:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:44,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:18:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:44,434 INFO L87 Difference]: Start difference. First operand 2467 states and 3108 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 07:18:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:44,585 INFO L93 Difference]: Finished difference Result 2497 states and 3128 transitions. [2024-11-09 07:18:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:18:44,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-09 07:18:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:44,593 INFO L225 Difference]: With dead ends: 2497 [2024-11-09 07:18:44,593 INFO L226 Difference]: Without dead ends: 2467 [2024-11-09 07:18:44,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:18:44,594 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 4 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:44,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1107 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2024-11-09 07:18:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2467. [2024-11-09 07:18:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2364 states have (on average 1.252115059221658) internal successors, (2960), 2379 states have internal predecessors, (2960), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-09 07:18:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3093 transitions. [2024-11-09 07:18:44,617 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3093 transitions. Word has length 179 [2024-11-09 07:18:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:44,618 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3093 transitions. [2024-11-09 07:18:44,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 07:18:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3093 transitions. [2024-11-09 07:18:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 07:18:44,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:44,619 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:18:44,643 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:44,819 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-11-09 07:18:44,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:18:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:44,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1581964118, now seen corresponding path program 5 times [2024-11-09 07:18:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:18:44,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354454028] [2024-11-09 07:18:44,821 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:18:44,821 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-11-09 07:18:44,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:18:44,823 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-11-09 07:18:44,824 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-11-09 07:18:54,375 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-09 07:18:54,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:18:54,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:18:54,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-09 07:18:54,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-09 07:18:56,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:18:56,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354454028] [2024-11-09 07:18:56,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354454028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:56,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:18:56,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:18:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858333056] [2024-11-09 07:18:56,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:18:56,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:18:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:18:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:18:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:18:56,663 INFO L87 Difference]: Start difference. First operand 2467 states and 3093 transitions. Second operand has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 07:19:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:08,777 INFO L93 Difference]: Finished difference Result 2622 states and 3373 transitions. [2024-11-09 07:19:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:19:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 182 [2024-11-09 07:19:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:08,784 INFO L225 Difference]: With dead ends: 2622 [2024-11-09 07:19:08,784 INFO L226 Difference]: Without dead ends: 2622 [2024-11-09 07:19:08,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:19:08,786 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 26 mSDsluCounter, 6579 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6858 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:08,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6858 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:19:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2024-11-09 07:19:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2592. [2024-11-09 07:19:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2489 states have (on average 1.2896745680996384) internal successors, (3210), 2504 states have internal predecessors, (3210), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-09 07:19:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3343 transitions. [2024-11-09 07:19:08,811 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3343 transitions. Word has length 182 [2024-11-09 07:19:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:08,812 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 3343 transitions. [2024-11-09 07:19:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 07:19:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3343 transitions. [2024-11-09 07:19:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 07:19:08,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:08,813 INFO L215 NwaCegarLoop]: trace histogram [96, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:19:08,856 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 (17)] Ended with exit code 0 [2024-11-09 07:19:09,014 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-11-09 07:19:09,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:09,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash -4324959, now seen corresponding path program 6 times [2024-11-09 07:19:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:09,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469016540] [2024-11-09 07:19:09,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:19:09,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:09,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:09,019 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-11-09 07:19:09,020 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-11-09 07:19:12,399 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-09 07:19:12,399 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:19:12,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:19:12,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4878 backedges. 476 proven. 10 refuted. 0 times theorem prover too weak. 4392 trivial. 0 not checked. [2024-11-09 07:19:12,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4878 backedges. 476 proven. 10 refuted. 0 times theorem prover too weak. 4392 trivial. 0 not checked. [2024-11-09 07:19:12,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469016540] [2024-11-09 07:19:12,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469016540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:19:12,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:19:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:19:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329809067] [2024-11-09 07:19:12,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:19:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:19:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:12,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:19:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:19:12,815 INFO L87 Difference]: Start difference. First operand 2592 states and 3343 transitions. Second operand has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 07:19:14,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:19:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:15,253 INFO L93 Difference]: Finished difference Result 2622 states and 3363 transitions. [2024-11-09 07:19:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:19:15,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 207 [2024-11-09 07:19:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:15,259 INFO L225 Difference]: With dead ends: 2622 [2024-11-09 07:19:15,259 INFO L226 Difference]: Without dead ends: 2592 [2024-11-09 07:19:15,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:19:15,260 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 7 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:15,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1658 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 07:19:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-11-09 07:19:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2592. [2024-11-09 07:19:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2489 states have (on average 1.2796303736440338) internal successors, (3185), 2504 states have internal predecessors, (3185), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-09 07:19:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3318 transitions. [2024-11-09 07:19:15,301 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3318 transitions. Word has length 207 [2024-11-09 07:19:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:15,302 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 3318 transitions. [2024-11-09 07:19:15,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 07:19:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3318 transitions. [2024-11-09 07:19:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-09 07:19:15,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:15,303 INFO L215 NwaCegarLoop]: trace histogram [92, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 07:19:15,325 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-11-09 07:19:15,503 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-11-09 07:19:15,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:15,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 538667509, now seen corresponding path program 1 times [2024-11-09 07:19:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379834822] [2024-11-09 07:19:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:15,506 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-11-09 07:19:15,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:15,508 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-11-09 07:19:15,509 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-11-09 07:19:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:17,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:19:17,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4494 backedges. 2320 proven. 1176 refuted. 0 times theorem prover too weak. 998 trivial. 0 not checked. [2024-11-09 07:19:18,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4494 backedges. 2208 proven. 1228 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2024-11-09 07:19:24,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379834822] [2024-11-09 07:19:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379834822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:19:24,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:19:24,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-09 07:19:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276231263] [2024-11-09 07:19:24,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:19:24,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-09 07:19:24,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:24,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-09 07:19:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-09 07:19:24,900 INFO L87 Difference]: Start difference. First operand 2592 states and 3318 transitions. Second operand has 102 states, 102 states have (on average 1.9215686274509804) internal successors, (196), 102 states have internal predecessors, (196), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)