./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:39:18,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:39:18,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:39:18,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:39:18,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:39:18,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:39:18,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:39:18,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:39:18,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:39:18,194 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:39:18,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:39:18,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:39:18,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:39:18,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:39:18,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:39:18,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:39:18,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:39:18,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:39:18,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:39:18,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:39:18,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:39:18,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:39:18,198 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:39:18,198 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:39:18,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:39:18,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:39:18,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:39:18,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:39:18,199 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:39:18,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:39:18,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:39:18,200 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:39:18,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:39:18,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:39:18,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:39:18,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:39:18,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:39:18,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:39:18,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:39:18,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:39:18,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:39:18,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:39:18,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:39:18,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:39:18,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:39:18,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2024-10-11 17:39:18,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:39:18,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:39:18,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:39:18,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:39:18,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:39:18,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-10-11 17:39:19,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:39:19,793 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:39:19,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-10-11 17:39:19,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72f5c1e8d/fbea514ebb6b41108a9b16df965a73a0/FLAGe9e1aed53 [2024-10-11 17:39:19,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/72f5c1e8d/fbea514ebb6b41108a9b16df965a73a0 [2024-10-11 17:39:19,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:39:19,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:39:19,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:39:19,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:39:19,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:39:19,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:19" (1/1) ... [2024-10-11 17:39:19,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69481dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:19, skipping insertion in model container [2024-10-11 17:39:19,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:19" (1/1) ... [2024-10-11 17:39:19,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:39:20,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:39:20,359 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:39:20,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f684d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:20, skipping insertion in model container [2024-10-11 17:39:20,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:39:20,360 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:39:20,361 INFO L158 Benchmark]: Toolchain (without parser) took 520.76ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 102.4MB in the beginning and 124.5MB in the end (delta: -22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:39:20,362 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 132.1MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:39:20,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.10ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 102.2MB in the beginning and 124.5MB in the end (delta: -22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:39:20,364 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.56ms. Allocated memory is still 132.1MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.10ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 102.2MB in the beginning and 124.5MB in the end (delta: -22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:39:21,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:39:21,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:39:21,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:39:21,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:39:21,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:39:21,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:39:21,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:39:21,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:39:21,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:39:21,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:39:21,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:39:21,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:39:21,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:39:21,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:39:21,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:39:21,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:39:21,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:39:21,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:39:21,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:39:21,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:39:21,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:39:21,972 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:39:21,972 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:39:21,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:39:21,974 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:39:21,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:39:21,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:39:21,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:39:21,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:39:21,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:39:21,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:39:21,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:39:21,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:39:21,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:39:21,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:39:21,976 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:39:21,976 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:39:21,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:39:21,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:39:21,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:39:21,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:39:21,977 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:39:21,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2024-10-11 17:39:22,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:39:22,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:39:22,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:39:22,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:39:22,229 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:39:22,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-10-11 17:39:23,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:39:23,676 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:39:23,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-10-11 17:39:23,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7c42368fa/8d859dd1a3464faabe5a6d67b1e75791/FLAG5b7fb14a6 [2024-10-11 17:39:24,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7c42368fa/8d859dd1a3464faabe5a6d67b1e75791 [2024-10-11 17:39:24,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:39:24,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:39:24,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:39:24,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:39:24,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:39:24,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe461f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24, skipping insertion in model container [2024-10-11 17:39:24,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:39:24,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:39:24,547 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:39:24,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:39:24,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:39:24,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:39:24,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:39:24,751 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:39:24,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24 WrapperNode [2024-10-11 17:39:24,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:39:24,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:39:24,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:39:24,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:39:24,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,852 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1429 [2024-10-11 17:39:24,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:39:24,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:39:24,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:39:24,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:39:24,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,951 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 1, 82]. [2024-10-11 17:39:24,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:24,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:25,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:25,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:25,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:39:25,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:39:25,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:39:25,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:39:25,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (1/1) ... [2024-10-11 17:39:25,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:39:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:39:25,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:39:25,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:39:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:39:25,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:39:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:39:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:39:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:39:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:39:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:39:25,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:39:25,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:39:25,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:39:25,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:39:25,291 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:39:25,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:39:37,767 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2024-10-11 17:39:37,767 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:39:37,789 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:39:37,790 INFO L314 CfgBuilder]: Removed 83 assume(true) statements. [2024-10-11 17:39:37,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:37 BoogieIcfgContainer [2024-10-11 17:39:37,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:39:37,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:39:37,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:39:37,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:39:37,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:39:24" (1/3) ... [2024-10-11 17:39:37,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd8c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:37, skipping insertion in model container [2024-10-11 17:39:37,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:24" (2/3) ... [2024-10-11 17:39:37,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fd8c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:37, skipping insertion in model container [2024-10-11 17:39:37,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:37" (3/3) ... [2024-10-11 17:39:37,797 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2024-10-11 17:39:37,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:39:37,809 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:39:37,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:39:37,856 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;@21f824cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:39:37,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:39:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 246 states have (on average 1.6829268292682926) internal successors, (414), 255 states have internal predecessors, (414), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 17:39:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:39:37,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:37,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:39:37,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:37,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -771941024, now seen corresponding path program 1 times [2024-10-11 17:39:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231339928] [2024-10-11 17:39:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:37,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:37,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:37,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:39:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:38,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:39:38,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:39:38,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:38,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231339928] [2024-10-11 17:39:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231339928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:39:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52387412] [2024-10-11 17:39:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:39:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:38,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:39:38,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:39:38,099 INFO L87 Difference]: Start difference. First operand has 265 states, 246 states have (on average 1.6829268292682926) internal successors, (414), 255 states have internal predecessors, (414), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:38,148 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2024-10-11 17:39:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:39:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:39:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:38,170 INFO L225 Difference]: With dead ends: 263 [2024-10-11 17:39:38,171 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 17:39:38,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-10-11 17:39:38,176 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:38,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:39:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 17:39:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-11 17:39:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 245 states have (on average 1.3061224489795917) internal successors, (320), 252 states have internal predecessors, (320), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 17:39:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2024-10-11 17:39:38,274 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 6 [2024-10-11 17:39:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:38,274 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2024-10-11 17:39:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2024-10-11 17:39:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:39:38,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:38,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:39:38,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:39:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:38,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:38,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1432258539, now seen corresponding path program 1 times [2024-10-11 17:39:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672993707] [2024-10-11 17:39:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:38,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:38,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:39:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:38,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:39:38,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:39:38,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:38,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672993707] [2024-10-11 17:39:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672993707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:39:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820509674] [2024-10-11 17:39:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:38,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:39:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:39:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:39:38,636 INFO L87 Difference]: Start difference. First operand 262 states and 344 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:38,857 INFO L93 Difference]: Finished difference Result 508 states and 672 transitions. [2024-10-11 17:39:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:39:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:39:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:38,860 INFO L225 Difference]: With dead ends: 508 [2024-10-11 17:39:38,863 INFO L226 Difference]: Without dead ends: 508 [2024-10-11 17:39:38,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:39:38,864 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 303 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:38,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 707 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:39:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-11 17:39:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 264. [2024-10-11 17:39:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 247 states have (on average 1.3036437246963564) internal successors, (322), 254 states have internal predecessors, (322), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 17:39:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 346 transitions. [2024-10-11 17:39:38,894 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 346 transitions. Word has length 6 [2024-10-11 17:39:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 346 transitions. [2024-10-11 17:39:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 346 transitions. [2024-10-11 17:39:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 17:39:38,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:38,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:38,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:39:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:39,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash -289292392, now seen corresponding path program 1 times [2024-10-11 17:39:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858609943] [2024-10-11 17:39:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:39,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:39,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:39,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:39:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:39,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:39:39,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:39:39,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:39,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858609943] [2024-10-11 17:39:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858609943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:39,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:39,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:39:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246674525] [2024-10-11 17:39:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:39:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:39:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:39:39,655 INFO L87 Difference]: Start difference. First operand 264 states and 346 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:39,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:39,758 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2024-10-11 17:39:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:39:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 151 [2024-10-11 17:39:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:39,760 INFO L225 Difference]: With dead ends: 267 [2024-10-11 17:39:39,760 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 17:39:39,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:39:39,761 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 30 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:39,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 916 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 17:39:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-11 17:39:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 250 states have (on average 1.268) internal successors, (317), 257 states have internal predecessors, (317), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 17:39:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 341 transitions. [2024-10-11 17:39:39,772 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 341 transitions. Word has length 151 [2024-10-11 17:39:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:39,772 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 341 transitions. [2024-10-11 17:39:39,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 341 transitions. [2024-10-11 17:39:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 17:39:39,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:39,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:39,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:39:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:39,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:39,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1086511628, now seen corresponding path program 1 times [2024-10-11 17:39:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:39,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128411640] [2024-10-11 17:39:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:39,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:39,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:39:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:40,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:39:40,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:39:40,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:40,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128411640] [2024-10-11 17:39:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128411640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:40,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:39:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257988766] [2024-10-11 17:39:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:39:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:40,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:39:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:39:40,628 INFO L87 Difference]: Start difference. First operand 267 states and 341 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:41,011 INFO L93 Difference]: Finished difference Result 309 states and 387 transitions. [2024-10-11 17:39:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:39:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 151 [2024-10-11 17:39:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:41,014 INFO L225 Difference]: With dead ends: 309 [2024-10-11 17:39:41,015 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 17:39:41,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:39:41,017 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 4 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:41,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 652 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:39:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 17:39:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-11 17:39:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 292 states have (on average 1.2431506849315068) internal successors, (363), 299 states have internal predecessors, (363), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 17:39:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2024-10-11 17:39:41,029 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 151 [2024-10-11 17:39:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:41,031 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2024-10-11 17:39:41,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:39:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2024-10-11 17:39:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 17:39:41,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:41,036 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:41,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:39:41,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:41,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:41,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1328617068, now seen corresponding path program 1 times [2024-10-11 17:39:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:41,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783395983] [2024-10-11 17:39:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:41,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:41,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:41,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:39:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:41,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:39:41,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:39:41,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:41,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783395983] [2024-10-11 17:39:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783395983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:39:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112453785] [2024-10-11 17:39:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:39:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:41,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:39:41,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:39:41,750 INFO L87 Difference]: Start difference. First operand 309 states and 387 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:39:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:41,810 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2024-10-11 17:39:41,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:39:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 164 [2024-10-11 17:39:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:41,812 INFO L225 Difference]: With dead ends: 311 [2024-10-11 17:39:41,812 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 17:39:41,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:39:41,813 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 0 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:41,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 974 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 17:39:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-11 17:39:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 293 states have (on average 1.2457337883959045) internal successors, (365), 301 states have internal predecessors, (365), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 391 transitions. [2024-10-11 17:39:41,819 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 391 transitions. Word has length 164 [2024-10-11 17:39:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:41,819 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 391 transitions. [2024-10-11 17:39:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:39:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 391 transitions. [2024-10-11 17:39:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 17:39:41,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:41,821 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:41,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 17:39:42,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:42,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:42,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1014843056, now seen corresponding path program 1 times [2024-10-11 17:39:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:42,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346275867] [2024-10-11 17:39:42,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:42,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:42,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:39:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:42,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:39:42,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:39:42,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:39:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:39:42,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346275867] [2024-10-11 17:39:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346275867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:39:42,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:39:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:39:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474111219] [2024-10-11 17:39:42,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:39:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:39:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:39:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:39:42,631 INFO L87 Difference]: Start difference. First operand 311 states and 391 transitions. Second operand has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:42,817 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2024-10-11 17:39:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:39:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 166 [2024-10-11 17:39:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:42,819 INFO L225 Difference]: With dead ends: 320 [2024-10-11 17:39:42,819 INFO L226 Difference]: Without dead ends: 320 [2024-10-11 17:39:42,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:39:42,820 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 4 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:42,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1929 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-11 17:39:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-11 17:39:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 300 states have (on average 1.26) internal successors, (378), 308 states have internal predecessors, (378), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2024-10-11 17:39:42,831 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 166 [2024-10-11 17:39:42,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:42,833 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2024-10-11 17:39:42,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2024-10-11 17:39:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 17:39:42,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:42,835 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:42,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:39:43,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:43,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:43,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2072846900, now seen corresponding path program 2 times [2024-10-11 17:39:43,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:43,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259202187] [2024-10-11 17:39:43,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:39:43,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:43,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:43,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:43,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:39:43,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:39:43,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:39:43,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:39:43,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 17:39:43,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:43,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259202187] [2024-10-11 17:39:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259202187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:39:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737422785] [2024-10-11 17:39:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:43,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:39:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:39:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:39:43,355 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:43,444 INFO L93 Difference]: Finished difference Result 322 states and 399 transitions. [2024-10-11 17:39:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:39:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-11 17:39:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:43,448 INFO L225 Difference]: With dead ends: 322 [2024-10-11 17:39:43,449 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 17:39:43,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:39:43,450 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 33 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:43,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 880 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 17:39:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-11 17:39:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 303 states have (on average 1.231023102310231) internal successors, (373), 311 states have internal predecessors, (373), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 399 transitions. [2024-10-11 17:39:43,460 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 399 transitions. Word has length 170 [2024-10-11 17:39:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:43,460 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 399 transitions. [2024-10-11 17:39:43,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 399 transitions. [2024-10-11 17:39:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 17:39:43,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:43,463 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:43,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:39:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:43,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 430195938, now seen corresponding path program 1 times [2024-10-11 17:39:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585276914] [2024-10-11 17:39:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:43,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:43,667 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:43,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:39:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:44,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:39:44,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:39:44,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:39:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:39:44,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:44,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585276914] [2024-10-11 17:39:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585276914] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:39:44,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:39:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:39:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329606604] [2024-10-11 17:39:44,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:39:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:39:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:39:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:39:44,411 INFO L87 Difference]: Start difference. First operand 322 states and 399 transitions. Second operand has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:44,902 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2024-10-11 17:39:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:39:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 170 [2024-10-11 17:39:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:44,905 INFO L225 Difference]: With dead ends: 334 [2024-10-11 17:39:44,905 INFO L226 Difference]: Without dead ends: 332 [2024-10-11 17:39:44,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:39:44,905 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:44,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1873 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:39:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-11 17:39:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2024-10-11 17:39:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 312 states have (on average 1.233974358974359) internal successors, (385), 320 states have internal predecessors, (385), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2024-10-11 17:39:44,912 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 170 [2024-10-11 17:39:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2024-10-11 17:39:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2024-10-11 17:39:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 17:39:44,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:44,914 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:44,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:39:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:45,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1261664479, now seen corresponding path program 2 times [2024-10-11 17:39:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757452243] [2024-10-11 17:39:45,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:39:45,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-10-11 17:39:45,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:45,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:45,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:39:45,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:39:45,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:39:45,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:39:45,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-11 17:39:45,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:45,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:45,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757452243] [2024-10-11 17:39:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757452243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:39:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015687039] [2024-10-11 17:39:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:39:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:39:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:39:45,484 INFO L87 Difference]: Start difference. First operand 331 states and 411 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:45,541 INFO L93 Difference]: Finished difference Result 325 states and 401 transitions. [2024-10-11 17:39:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:39:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 179 [2024-10-11 17:39:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:45,544 INFO L225 Difference]: With dead ends: 325 [2024-10-11 17:39:45,545 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 17:39:45,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:39:45,545 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 4 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:45,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 880 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 17:39:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-10-11 17:39:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 306 states have (on average 1.2254901960784315) internal successors, (375), 314 states have internal predecessors, (375), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 401 transitions. [2024-10-11 17:39:45,554 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 401 transitions. Word has length 179 [2024-10-11 17:39:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:45,555 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 401 transitions. [2024-10-11 17:39:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 401 transitions. [2024-10-11 17:39:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 17:39:45,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:45,556 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:45,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 17:39:45,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:45,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:45,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1723770265, now seen corresponding path program 1 times [2024-10-11 17:39:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416354561] [2024-10-11 17:39:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:45,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:45,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:45,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:39:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:46,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:39:46,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 17:39:46,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:39:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:39:46,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:46,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416354561] [2024-10-11 17:39:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416354561] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:39:46,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:39:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:39:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860472974] [2024-10-11 17:39:46,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:39:46,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:39:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:39:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:39:46,980 INFO L87 Difference]: Start difference. First operand 325 states and 401 transitions. Second operand has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:48,370 INFO L93 Difference]: Finished difference Result 346 states and 439 transitions. [2024-10-11 17:39:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:39:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 179 [2024-10-11 17:39:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:48,372 INFO L225 Difference]: With dead ends: 346 [2024-10-11 17:39:48,372 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 17:39:48,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:39:48,374 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 14 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:48,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4300 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 17:39:48,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 17:39:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2024-10-11 17:39:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 324 states have (on average 1.2314814814814814) internal successors, (399), 332 states have internal predecessors, (399), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2024-10-11 17:39:48,384 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 179 [2024-10-11 17:39:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:48,385 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2024-10-11 17:39:48,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2024-10-11 17:39:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 17:39:48,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:48,386 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:48,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 17:39:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:48,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 515521671, now seen corresponding path program 2 times [2024-10-11 17:39:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122085597] [2024-10-11 17:39:48,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:39:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:48,591 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:48,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:39:49,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:39:49,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:39:49,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:39:49,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 17:39:49,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:39:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 17:39:51,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122085597] [2024-10-11 17:39:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122085597] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:39:51,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:39:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:39:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687134996] [2024-10-11 17:39:51,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:39:51,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:39:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:39:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:39:51,060 INFO L87 Difference]: Start difference. First operand 343 states and 425 transitions. Second operand has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:55,933 INFO L93 Difference]: Finished difference Result 380 states and 495 transitions. [2024-10-11 17:39:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:39:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2024-10-11 17:39:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:55,935 INFO L225 Difference]: With dead ends: 380 [2024-10-11 17:39:55,935 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 17:39:55,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:39:55,937 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 7368 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7679 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:55,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7679 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 17:39:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 17:39:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-11 17:39:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 366 states have internal predecessors, (445), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-10-11 17:39:55,943 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 197 [2024-10-11 17:39:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:55,944 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-10-11 17:39:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:39:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-10-11 17:39:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 17:39:55,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:55,945 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:55,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 17:39:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:56,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -803160793, now seen corresponding path program 3 times [2024-10-11 17:39:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926924510] [2024-10-11 17:39:56,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:39:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:56,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:56,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:56,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:39:56,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:39:56,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:39:56,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:39:56,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-11 17:39:56,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:39:56,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926924510] [2024-10-11 17:39:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926924510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:39:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:39:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:39:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642304765] [2024-10-11 17:39:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:39:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:39:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:39:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:39:56,770 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:39:56,855 INFO L93 Difference]: Finished difference Result 380 states and 466 transitions. [2024-10-11 17:39:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:39:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-11 17:39:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:39:56,857 INFO L225 Difference]: With dead ends: 380 [2024-10-11 17:39:56,857 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 17:39:56,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:39:56,858 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 30 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:39:56,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 838 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:39:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 17:39:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2024-10-11 17:39:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 361 states have (on average 1.2188365650969528) internal successors, (440), 369 states have internal predecessors, (440), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:39:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 466 transitions. [2024-10-11 17:39:56,866 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 466 transitions. Word has length 231 [2024-10-11 17:39:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:39:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 466 transitions. [2024-10-11 17:39:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:39:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 466 transitions. [2024-10-11 17:39:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 17:39:56,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:39:56,868 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:39:56,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:39:57,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:57,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:39:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:39:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 701472563, now seen corresponding path program 1 times [2024-10-11 17:39:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:39:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431566232] [2024-10-11 17:39:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:39:57,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:39:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:39:57,073 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:39:57,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:39:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:39:58,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:39:58,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:39:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:39:58,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:39:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:39:59,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:39:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431566232] [2024-10-11 17:39:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431566232] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:39:59,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:39:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:39:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763368342] [2024-10-11 17:39:59,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:39:59,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:39:59,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:39:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:39:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:39:59,942 INFO L87 Difference]: Start difference. First operand 380 states and 466 transitions. Second operand has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:40:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:40:05,152 INFO L93 Difference]: Finished difference Result 407 states and 520 transitions. [2024-10-11 17:40:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:40:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2024-10-11 17:40:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:40:05,154 INFO L225 Difference]: With dead ends: 407 [2024-10-11 17:40:05,154 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 17:40:05,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-11 17:40:05,156 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 26 mSDsluCounter, 7354 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7653 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:40:05,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7653 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 17:40:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 17:40:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-11 17:40:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 386 states have (on average 1.2694300518134716) internal successors, (490), 394 states have internal predecessors, (490), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:40:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 516 transitions. [2024-10-11 17:40:05,166 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 516 transitions. Word has length 231 [2024-10-11 17:40:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:40:05,167 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 516 transitions. [2024-10-11 17:40:05,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:40:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 516 transitions. [2024-10-11 17:40:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-11 17:40:05,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:40:05,168 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:40:05,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-11 17:40:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:05,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:40:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:40:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1765962028, now seen corresponding path program 2 times [2024-10-11 17:40:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:40:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096563601] [2024-10-11 17:40:05,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:40:05,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:40:05,373 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:40:05,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 17:40:07,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:40:07,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:40:07,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:40:07,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:40:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:40:08,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:40:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:40:13,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:40:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096563601] [2024-10-11 17:40:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096563601] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:40:13,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:40:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-11 17:40:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873813579] [2024-10-11 17:40:13,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:40:13,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 17:40:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:40:13,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 17:40:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 17:40:13,519 INFO L87 Difference]: Start difference. First operand 405 states and 516 transitions. Second operand has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:40:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:40:39,637 INFO L93 Difference]: Finished difference Result 461 states and 627 transitions. [2024-10-11 17:40:39,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-11 17:40:39,638 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 256 [2024-10-11 17:40:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:40:39,640 INFO L225 Difference]: With dead ends: 461 [2024-10-11 17:40:39,640 INFO L226 Difference]: Without dead ends: 461 [2024-10-11 17:40:39,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-10-11 17:40:39,645 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 57 mSDsluCounter, 14408 mSDsCounter, 0 mSdLazyCounter, 5593 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14707 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 5593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:40:39,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14707 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 5593 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 17:40:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-11 17:40:39,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2024-10-11 17:40:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 440 states have (on average 1.356818181818182) internal successors, (597), 448 states have internal predecessors, (597), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 17:40:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 623 transitions. [2024-10-11 17:40:39,652 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 623 transitions. Word has length 256 [2024-10-11 17:40:39,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:40:39,652 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 623 transitions. [2024-10-11 17:40:39,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 17:40:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 623 transitions. [2024-10-11 17:40:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-11 17:40:39,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:40:39,654 INFO L215 NwaCegarLoop]: trace histogram [142, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:40:39,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 17:40:39,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:39,855 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:40:39,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:40:39,855 INFO L85 PathProgramCache]: Analyzing trace with hash -5657676, now seen corresponding path program 3 times [2024-10-11 17:40:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:40:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857126757] [2024-10-11 17:40:39,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:40:39,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:39,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:40:39,859 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:40:39,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 17:40:40,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:40:40,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:40:40,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:40:40,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:40:40,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-11 17:40:40,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:40:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-11 17:40:40,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:40:40,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857126757] [2024-10-11 17:40:40,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857126757] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:40:40,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:40:40,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 17:40:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069344576] [2024-10-11 17:40:40,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:40:40,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:40:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:40:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:40:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:40:40,923 INFO L87 Difference]: Start difference. First operand 459 states and 623 transitions. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:40:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:40:41,312 INFO L93 Difference]: Finished difference Result 1092 states and 1401 transitions. [2024-10-11 17:40:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:40:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 306 [2024-10-11 17:40:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:40:41,316 INFO L225 Difference]: With dead ends: 1092 [2024-10-11 17:40:41,316 INFO L226 Difference]: Without dead ends: 1092 [2024-10-11 17:40:41,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:40:41,317 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 1293 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:40:41,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1376 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:40:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-10-11 17:40:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1023. [2024-10-11 17:40:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 981 states have (on average 1.2599388379204892) internal successors, (1236), 994 states have internal predecessors, (1236), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (42), 26 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-11 17:40:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1314 transitions. [2024-10-11 17:40:41,339 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1314 transitions. Word has length 306 [2024-10-11 17:40:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:40:41,340 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1314 transitions. [2024-10-11 17:40:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:40:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1314 transitions. [2024-10-11 17:40:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-10-11 17:40:41,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:40:41,346 INFO L215 NwaCegarLoop]: trace histogram [142, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-11 17:40:41,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 17:40:41,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:41,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:40:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:40:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1162333172, now seen corresponding path program 1 times [2024-10-11 17:40:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:40:41,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063515480] [2024-10-11 17:40:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:40:41,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:40:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:40:41,550 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:40:41,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 17:40:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:40:44,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 3716 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-11 17:40:44,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:40:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10932 backedges. 4568 proven. 4851 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-10-11 17:40:50,229 INFO L311 TraceCheckSpWp]: Computing backward predicates...