./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_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:40:07,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:40:08,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:40:08,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:40:08,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:40:08,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:40:08,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:40:08,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:40:08,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:40:08,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:40:08,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:40:08,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:40:08,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:40:08,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:40:08,058 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:40:08,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:40:08,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:40:08,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:40:08,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:40:08,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:40:08,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:40:08,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:40:08,065 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:40:08,066 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:40:08,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:40:08,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:40:08,066 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:40:08,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:40:08,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:40:08,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:40:08,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:40:08,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:40:08,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:40:08,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:40:08,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:40:08,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:40:08,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:40:08,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:40:08,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:40:08,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:40:08,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:40:08,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:40:08,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:40:08,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:40:08,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:40:08,074 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-14 17:40:08,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:40:08,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:40:08,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:40:08,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:40:08,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:40:08,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-14 17:40:09,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:40:10,107 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:40:10,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-14 17:40:10,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd65bf8c/188210c36ed1481291554472e8079418/FLAG266f69c2e [2024-10-14 17:40:10,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fd65bf8c/188210c36ed1481291554472e8079418 [2024-10-14 17:40:10,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:40:10,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:40:10,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:40:10,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:40:10,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:40:10,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:40:10" (1/1) ... [2024-10-14 17:40:10,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f7d38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:10, skipping insertion in model container [2024-10-14 17:40:10,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:40:10" (1/1) ... [2024-10-14 17:40:10,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:40:10,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:40:10,743 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-14 17:40:10,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@38db4531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:10, skipping insertion in model container [2024-10-14 17:40:10,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:40:10,744 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:40:10,746 INFO L158 Benchmark]: Toolchain (without parser) took 601.22ms. Allocated memory is still 163.6MB. Free memory was 133.0MB in the beginning and 109.1MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 17:40:10,746 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 163.6MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:40:10,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.85ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 109.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 17:40:10,752 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.50ms. Allocated memory is still 163.6MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.85ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 109.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:40:12,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:40:12,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:40:12,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:40:12,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:40:12,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:40:12,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:40:12,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:40:12,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:40:12,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:40:12,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:40:12,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:40:12,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:40:12,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:40:12,862 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:40:12,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:40:12,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:40:12,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:40:12,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:40:12,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:40:12,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:40:12,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:40:12,870 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:40:12,871 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:40:12,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:40:12,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:40:12,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:40:12,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:40:12,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:40:12,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:40:12,872 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:40:12,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:40:12,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:40:12,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:40:12,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:40:12,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:40:12,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:40:12,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:40:12,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:40:12,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:40:12,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:40:12,876 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:40:12,876 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:40:12,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:40:12,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:40:12,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:40:12,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:40:12,877 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:40:12,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-14 17:40:13,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:40:13,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:40:13,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:40:13,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:40:13,229 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:40:13,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-14 17:40:14,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:40:15,156 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:40:15,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-14 17:40:15,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2988b07/2975f16ed21c40f384b86218997fdc4e/FLAG7a9cab652 [2024-10-14 17:40:15,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac2988b07/2975f16ed21c40f384b86218997fdc4e [2024-10-14 17:40:15,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:40:15,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:40:15,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:40:15,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:40:15,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:40:15,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:40:15" (1/1) ... [2024-10-14 17:40:15,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191134e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:15, skipping insertion in model container [2024-10-14 17:40:15,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:40:15" (1/1) ... [2024-10-14 17:40:15,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:40:15,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:40:15,854 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:40:15,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:40:15,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:40:15,997 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:40:16,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:40:16,135 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:40:16,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16 WrapperNode [2024-10-14 17:40:16,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:40:16,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:40:16,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:40:16,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:40:16,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,249 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1429 [2024-10-14 17:40:16,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:40:16,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:40:16,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:40:16,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:40:16,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,381 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [323, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 83 writes are split as follows [82, 0, 1]. [2024-10-14 17:40:16,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:40:16,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:40:16,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:40:16,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:40:16,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (1/1) ... [2024-10-14 17:40:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:40:16,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:40:16,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:40:16,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:40:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:40:16,590 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:40:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:40:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:40:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:40:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:40:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:40:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:40:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:40:16,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:40:16,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:40:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:40:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:40:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:40:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:40:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:40:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:40:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:40:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:40:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:40:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:40:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:40:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:40:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:40:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:40:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:40:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:40:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:40:16,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:40:16,883 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:40:16,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:40:30,274 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2024-10-14 17:40:30,274 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:40:30,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:40:30,314 INFO L314 CfgBuilder]: Removed 83 assume(true) statements. [2024-10-14 17:40:30,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:40:30 BoogieIcfgContainer [2024-10-14 17:40:30,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:40:30,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:40:30,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:40:30,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:40:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:40:15" (1/3) ... [2024-10-14 17:40:30,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1bdb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:40:30, skipping insertion in model container [2024-10-14 17:40:30,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:40:16" (2/3) ... [2024-10-14 17:40:30,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1bdb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:40:30, skipping insertion in model container [2024-10-14 17:40:30,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:40:30" (3/3) ... [2024-10-14 17:40:30,322 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-10-14 17:40:30,337 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:40:30,337 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:40:30,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:40:30,404 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;@77d45b13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:40:30,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:40:30,409 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-14 17:40:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:40:30,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:30,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:40:30,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:30,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -771941024, now seen corresponding path program 1 times [2024-10-14 17:40:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336190138] [2024-10-14 17:40:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:30,428 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-14 17:40:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:30,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:30,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:40:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:30,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:40:30,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:30,764 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-14 17:40:30,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:30,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336190138] [2024-10-14 17:40:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336190138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:40:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595379942] [2024-10-14 17:40:30,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:40:30,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:40:30,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:40:30,798 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-14 17:40:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:30,865 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2024-10-14 17:40:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:40:30,867 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-14 17:40:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:30,878 INFO L225 Difference]: With dead ends: 263 [2024-10-14 17:40:30,878 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 17:40:30,880 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-14 17:40:30,883 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-14 17:40:30,883 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-14 17:40:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 17:40:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-14 17:40:30,984 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-14 17:40:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2024-10-14 17:40:30,999 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 6 [2024-10-14 17:40:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:31,000 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2024-10-14 17:40:31,000 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-14 17:40:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2024-10-14 17:40:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:40:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:31,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:40:31,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:40:31,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:31,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1432258539, now seen corresponding path program 1 times [2024-10-14 17:40:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835038188] [2024-10-14 17:40:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:31,203 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-14 17:40:31,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:31,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:31,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:40:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:31,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:40:31,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:31,382 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-14 17:40:31,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:31,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:31,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835038188] [2024-10-14 17:40:31,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835038188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:31,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:31,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:40:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740545996] [2024-10-14 17:40:31,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:31,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:40:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:40:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:40:31,388 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-14 17:40:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:31,646 INFO L93 Difference]: Finished difference Result 508 states and 672 transitions. [2024-10-14 17:40:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:40:31,647 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-14 17:40:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:31,650 INFO L225 Difference]: With dead ends: 508 [2024-10-14 17:40:31,651 INFO L226 Difference]: Without dead ends: 508 [2024-10-14 17:40:31,651 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-14 17:40:31,652 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-14 17:40:31,652 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-14 17:40:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-14 17:40:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 264. [2024-10-14 17:40:31,671 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-14 17:40:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 346 transitions. [2024-10-14 17:40:31,673 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 346 transitions. Word has length 6 [2024-10-14 17:40:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 346 transitions. [2024-10-14 17:40:31,674 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-14 17:40:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 346 transitions. [2024-10-14 17:40:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 17:40:31,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:31,681 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-14 17:40:31,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:40:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:31,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -289292392, now seen corresponding path program 1 times [2024-10-14 17:40:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645462589] [2024-10-14 17:40:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:31,888 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-14 17:40:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:31,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:31,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:40:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:32,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:40:32,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:32,665 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-14 17:40:32,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:32,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645462589] [2024-10-14 17:40:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645462589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:40:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96460436] [2024-10-14 17:40:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:32,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:40:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:40:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:40:32,672 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-14 17:40:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:32,819 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2024-10-14 17:40:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:40:32,820 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-14 17:40:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:32,822 INFO L225 Difference]: With dead ends: 267 [2024-10-14 17:40:32,822 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 17:40:32,822 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-14 17:40:32,825 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-14 17:40:32,825 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-14 17:40:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 17:40:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-14 17:40:32,839 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-14 17:40:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 341 transitions. [2024-10-14 17:40:32,841 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 341 transitions. Word has length 151 [2024-10-14 17:40:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 341 transitions. [2024-10-14 17:40:32,841 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-14 17:40:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 341 transitions. [2024-10-14 17:40:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 17:40:32,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:32,844 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-14 17:40:32,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:40:33,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:33,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:33,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1086511628, now seen corresponding path program 1 times [2024-10-14 17:40:33,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:33,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422659353] [2024-10-14 17:40:33,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:33,051 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-14 17:40:33,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:33,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:33,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:40:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:33,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:40:33,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:33,857 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-14 17:40:33,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:33,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422659353] [2024-10-14 17:40:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422659353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:33,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:33,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:40:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747841559] [2024-10-14 17:40:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:33,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:40:33,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:40:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:40:33,864 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-14 17:40:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:34,363 INFO L93 Difference]: Finished difference Result 309 states and 387 transitions. [2024-10-14 17:40:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:40:34,363 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-14 17:40:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:34,365 INFO L225 Difference]: With dead ends: 309 [2024-10-14 17:40:34,365 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 17:40:34,365 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-14 17:40:34,366 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 4 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:40:34,367 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.5s Time] [2024-10-14 17:40:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 17:40:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-14 17:40:34,388 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-14 17:40:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2024-10-14 17:40:34,390 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 151 [2024-10-14 17:40:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:34,391 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2024-10-14 17:40:34,391 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-14 17:40:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2024-10-14 17:40:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 17:40:34,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:34,394 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-14 17:40:34,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:40:34,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:34,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -991382010, now seen corresponding path program 1 times [2024-10-14 17:40:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840905386] [2024-10-14 17:40:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:34,598 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-14 17:40:34,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:34,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:34,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:40:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:35,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:40:35,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:35,236 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-14 17:40:35,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:35,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:35,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840905386] [2024-10-14 17:40:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840905386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:35,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:40:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136137644] [2024-10-14 17:40:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:35,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:40:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:35,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:40:35,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:40:35,249 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-14 17:40:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:35,311 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2024-10-14 17:40:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:40:35,313 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-14 17:40:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:35,315 INFO L225 Difference]: With dead ends: 311 [2024-10-14 17:40:35,315 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 17:40:35,315 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-14 17:40:35,316 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-14 17:40:35,320 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-14 17:40:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 17:40:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-14 17:40:35,330 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-14 17:40:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 391 transitions. [2024-10-14 17:40:35,331 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 391 transitions. Word has length 164 [2024-10-14 17:40:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 391 transitions. [2024-10-14 17:40:35,332 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-14 17:40:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 391 transitions. [2024-10-14 17:40:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 17:40:35,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:35,335 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-14 17:40:35,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:40:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:35,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -985989232, now seen corresponding path program 1 times [2024-10-14 17:40:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:35,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288264933] [2024-10-14 17:40:35,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:35,538 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-14 17:40:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:35,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:35,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:40:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:36,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:40:36,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:36,221 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-14 17:40:36,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:40:36,293 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-14 17:40:36,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:36,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288264933] [2024-10-14 17:40:36,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288264933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:40:36,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:40:36,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:40:36,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842566291] [2024-10-14 17:40:36,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:40:36,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:40:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:40:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:40:36,297 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-14 17:40:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:36,486 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2024-10-14 17:40:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:40:36,487 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-14 17:40:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:36,488 INFO L225 Difference]: With dead ends: 320 [2024-10-14 17:40:36,488 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 17:40:36,489 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-14 17:40:36,489 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-14 17:40:36,490 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-14 17:40:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 17:40:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-14 17:40:36,497 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-14 17:40:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2024-10-14 17:40:36,498 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 166 [2024-10-14 17:40:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:36,499 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2024-10-14 17:40:36,499 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-14 17:40:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2024-10-14 17:40:36,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 17:40:36,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:36,502 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-14 17:40:36,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:40:36,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:36,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:36,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1354334054, now seen corresponding path program 2 times [2024-10-14 17:40:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958584654] [2024-10-14 17:40:36,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:40:36,704 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-14 17:40:36,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:36,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:36,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:40:37,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:40:37,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:40:37,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:40:37,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:37,130 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-14 17:40:37,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:37,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:37,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958584654] [2024-10-14 17:40:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958584654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:37,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:37,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:40:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474282517] [2024-10-14 17:40:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:40:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:40:37,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:40:37,133 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-14 17:40:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:37,244 INFO L93 Difference]: Finished difference Result 322 states and 399 transitions. [2024-10-14 17:40:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:40:37,245 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-14 17:40:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:37,247 INFO L225 Difference]: With dead ends: 322 [2024-10-14 17:40:37,247 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 17:40:37,247 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-14 17:40:37,248 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-14 17:40:37,248 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-14 17:40:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 17:40:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-14 17:40:37,254 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-14 17:40:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 399 transitions. [2024-10-14 17:40:37,256 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 399 transitions. Word has length 170 [2024-10-14 17:40:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:37,257 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 399 transitions. [2024-10-14 17:40:37,257 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-14 17:40:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 399 transitions. [2024-10-14 17:40:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-14 17:40:37,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:37,259 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-14 17:40:37,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:40:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:37,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -288316908, now seen corresponding path program 1 times [2024-10-14 17:40:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:37,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089387910] [2024-10-14 17:40:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:37,462 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-14 17:40:37,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:37,463 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:37,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:40:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:38,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:40:38,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:38,207 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-14 17:40:38,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:40:38,406 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-14 17:40:38,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089387910] [2024-10-14 17:40:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089387910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:40:38,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:40:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:40:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076884532] [2024-10-14 17:40:38,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:40:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:40:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:40:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:40:38,410 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-14 17:40:38,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:38,945 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2024-10-14 17:40:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:40:38,945 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-14 17:40:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:38,947 INFO L225 Difference]: With dead ends: 334 [2024-10-14 17:40:38,947 INFO L226 Difference]: Without dead ends: 332 [2024-10-14 17:40:38,948 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-14 17:40:38,948 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-14 17:40:38,949 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-14 17:40:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-14 17:40:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2024-10-14 17:40:38,955 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-14 17:40:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2024-10-14 17:40:38,957 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 170 [2024-10-14 17:40:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2024-10-14 17:40:38,958 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-14 17:40:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2024-10-14 17:40:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 17:40:38,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:38,960 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-14 17:40:38,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:40:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:39,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:39,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash 942129545, now seen corresponding path program 2 times [2024-10-14 17:40:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732445924] [2024-10-14 17:40:39,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:40:39,162 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-14 17:40:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:39,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:39,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:40:39,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:40:39,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:40:39,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:40:39,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:39,658 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-14 17:40:39,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:39,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732445924] [2024-10-14 17:40:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732445924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:40:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299158687] [2024-10-14 17:40:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:39,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:40:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:39,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:40:39,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:40:39,661 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-14 17:40:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:39,735 INFO L93 Difference]: Finished difference Result 325 states and 401 transitions. [2024-10-14 17:40:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:40:39,736 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-14 17:40:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:39,738 INFO L225 Difference]: With dead ends: 325 [2024-10-14 17:40:39,738 INFO L226 Difference]: Without dead ends: 325 [2024-10-14 17:40:39,739 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-14 17:40:39,739 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 4 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 17:40:39,739 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-14 17:40:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-14 17:40:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-10-14 17:40:39,746 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-14 17:40:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 401 transitions. [2024-10-14 17:40:39,749 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 401 transitions. Word has length 179 [2024-10-14 17:40:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:39,751 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 401 transitions. [2024-10-14 17:40:39,751 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-14 17:40:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 401 transitions. [2024-10-14 17:40:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 17:40:39,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:39,754 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-14 17:40:39,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:40:39,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:39,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:39,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:39,959 INFO L85 PathProgramCache]: Analyzing trace with hash 480023759, now seen corresponding path program 1 times [2024-10-14 17:40:39,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:39,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54351913] [2024-10-14 17:40:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:39,960 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-14 17:40:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:39,963 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:39,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:40:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:40,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:40:40,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:40,812 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-14 17:40:40,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:40:41,372 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-14 17:40:41,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54351913] [2024-10-14 17:40:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54351913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:40:41,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:40:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:40:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824301938] [2024-10-14 17:40:41,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:40:41,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:40:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:41,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:40:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:40:41,375 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-14 17:40:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:42,900 INFO L93 Difference]: Finished difference Result 346 states and 439 transitions. [2024-10-14 17:40:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:40:42,901 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-14 17:40:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:42,902 INFO L225 Difference]: With dead ends: 346 [2024-10-14 17:40:42,902 INFO L226 Difference]: Without dead ends: 344 [2024-10-14 17:40:42,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:40:42,904 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 14 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-14 17:40:42,906 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-14 17:40:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-14 17:40:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2024-10-14 17:40:42,915 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-14 17:40:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2024-10-14 17:40:42,917 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 179 [2024-10-14 17:40:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:42,917 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2024-10-14 17:40:42,917 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-14 17:40:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2024-10-14 17:40:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-14 17:40:42,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:42,920 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-14 17:40:42,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:40:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:43,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -866878289, now seen corresponding path program 2 times [2024-10-14 17:40:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060159985] [2024-10-14 17:40:43,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:40:43,122 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-14 17:40:43,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:43,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:43,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:40:43,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:40:43,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:40:43,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:40:43,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:44,386 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-14 17:40:44,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:40:45,998 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-14 17:40:45,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060159985] [2024-10-14 17:40:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060159985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:40:45,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:40:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:40:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061706223] [2024-10-14 17:40:46,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:40:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:40:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:40:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:40:46,003 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-14 17:40:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:51,925 INFO L93 Difference]: Finished difference Result 380 states and 495 transitions. [2024-10-14 17:40:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:40:51,926 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-14 17:40:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:51,927 INFO L225 Difference]: With dead ends: 380 [2024-10-14 17:40:51,927 INFO L226 Difference]: Without dead ends: 378 [2024-10-14 17:40:51,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:40:51,930 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 7368 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:40:51,930 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.5s Time] [2024-10-14 17:40:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-14 17:40:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-14 17:40:51,937 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-14 17:40:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-10-14 17:40:51,939 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 197 [2024-10-14 17:40:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:51,939 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-10-14 17:40:51,939 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-14 17:40:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-10-14 17:40:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 17:40:51,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:51,942 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-14 17:40:51,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:40:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:52,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash -730342961, now seen corresponding path program 3 times [2024-10-14 17:40:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:52,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405282325] [2024-10-14 17:40:52,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:40:52,146 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-14 17:40:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:52,149 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:52,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 17:40:52,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:40:52,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:40:52,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:40:52,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:52,948 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-14 17:40:52,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:40:52,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:52,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405282325] [2024-10-14 17:40:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405282325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:40:52,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:40:52,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:40:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782370018] [2024-10-14 17:40:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:40:52,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:40:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:40:52,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:40:52,951 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-14 17:40:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:40:53,074 INFO L93 Difference]: Finished difference Result 380 states and 466 transitions. [2024-10-14 17:40:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:40:53,075 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-14 17:40:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:40:53,077 INFO L225 Difference]: With dead ends: 380 [2024-10-14 17:40:53,078 INFO L226 Difference]: Without dead ends: 380 [2024-10-14 17:40:53,078 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-14 17:40:53,078 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-14 17:40:53,079 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-14 17:40:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-14 17:40:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2024-10-14 17:40:53,088 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-14 17:40:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 466 transitions. [2024-10-14 17:40:53,089 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 466 transitions. Word has length 231 [2024-10-14 17:40:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:40:53,090 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 466 transitions. [2024-10-14 17:40:53,090 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-14 17:40:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 466 transitions. [2024-10-14 17:40:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 17:40:53,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:40:53,109 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-14 17:40:53,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 17:40:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:40:53,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:40:53,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:40:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash 774290395, now seen corresponding path program 1 times [2024-10-14 17:40:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:40:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060941557] [2024-10-14 17:40:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:40:53,312 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-14 17:40:53,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:40:53,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:40:53,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:40:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:40:54,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:40:54,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:40:55,265 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-14 17:40:55,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:40:56,982 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-14 17:40:56,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:40:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060941557] [2024-10-14 17:40:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060941557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:40:56,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:40:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:40:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904610027] [2024-10-14 17:40:56,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:40:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:40:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:40:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:40:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:40:56,987 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-14 17:41:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:41:02,640 INFO L93 Difference]: Finished difference Result 407 states and 520 transitions. [2024-10-14 17:41:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:41:02,644 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-14 17:41:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:41:02,646 INFO L225 Difference]: With dead ends: 407 [2024-10-14 17:41:02,646 INFO L226 Difference]: Without dead ends: 407 [2024-10-14 17:41:02,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:41:02,649 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 26 mSDsluCounter, 7354 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:41:02,649 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.7s Time] [2024-10-14 17:41:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-14 17:41:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-14 17:41:02,657 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-14 17:41:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 516 transitions. [2024-10-14 17:41:02,659 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 516 transitions. Word has length 231 [2024-10-14 17:41:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:41:02,659 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 516 transitions. [2024-10-14 17:41:02,659 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-14 17:41:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 516 transitions. [2024-10-14 17:41:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-14 17:41:02,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:41:02,661 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-14 17:41:02,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 17:41:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:41:02,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:41:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:41:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1955009350, now seen corresponding path program 2 times [2024-10-14 17:41:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:41:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478291165] [2024-10-14 17:41:02,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:41:02,864 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-14 17:41:02,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:41:02,866 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:41:02,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:41:04,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:41:04,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:41:04,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:41:04,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:41:06,445 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-14 17:41:06,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:41:12,320 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-14 17:41:12,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:41:12,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478291165] [2024-10-14 17:41:12,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478291165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:41:12,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:41:12,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:41:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386238700] [2024-10-14 17:41:12,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:41:12,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:41:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:41:12,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:41:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:41:12,326 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)