./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_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-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 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:18:50,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:18:51,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:18:51,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:18:51,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:18:51,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:18:51,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:18:51,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:18:51,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:18:51,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:18:51,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:18:51,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:18:51,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:18:51,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:18:51,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:18:51,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:18:51,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:18:51,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:18:51,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:18:51,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:18:51,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:18:51,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:18:51,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:18:51,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:18:51,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:18:51,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:18:51,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:18:51,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:18:51,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:18:51,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:18:51,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:18:51,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:18:51,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:18:51,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:18:51,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:18:51,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:18:51,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:18:51,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:18:51,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:18:51,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:18:51,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:18:51,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:18:51,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:18:51,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:18:51,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:18:51,127 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-10-13 10:18:51,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:18:51,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:18:51,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:18:51,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:18:51,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:18:51,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-10-13 10:18:52,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:18:53,152 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:18:53,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-10-13 10:18:53,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73efd232f/51d053d5d10c451ca096854d5f1edb7c/FLAGd3d1e7d0b [2024-10-13 10:18:53,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73efd232f/51d053d5d10c451ca096854d5f1edb7c [2024-10-13 10:18:53,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:18:53,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:18:53,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:53,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:18:53,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:18:53,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:53" (1/1) ... [2024-10-13 10:18:53,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ed61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:53, skipping insertion in model container [2024-10-13 10:18:53,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:53" (1/1) ... [2024-10-13 10:18:53,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:53,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:53,868 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:18:53,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e3c702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:53, skipping insertion in model container [2024-10-13 10:18:53,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:53,870 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:18:53,872 INFO L158 Benchmark]: Toolchain (without parser) took 676.56ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 78.5MB in the beginning and 154.2MB in the end (delta: -75.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-13 10:18:53,873 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:18:53,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.15ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 154.2MB in the end (delta: -76.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-13 10:18:53,875 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.68ms. Allocated memory is still 151.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.15ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 78.2MB in the beginning and 154.2MB in the end (delta: -76.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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_OAT_test2-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 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:18:56,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:18:56,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:18:56,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:18:56,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:18:56,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:18:56,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:18:56,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:18:56,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:18:56,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:18:56,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:18:56,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:18:56,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:18:56,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:18:56,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:18:56,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:18:56,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:18:56,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:18:56,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:18:56,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:18:56,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:18:56,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:18:56,264 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:18:56,264 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:18:56,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:18:56,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:18:56,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:18:56,265 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:18:56,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:18:56,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:18:56,265 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:18:56,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:18:56,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:18:56,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:18:56,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:18:56,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:18:56,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:18:56,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:18:56,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:18:56,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:18:56,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:18:56,271 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:18:56,271 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:18:56,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:18:56,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:18:56,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:18:56,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:18:56,272 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:18:56,273 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 -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2024-10-13 10:18:56,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:18:56,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:18:56,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:18:56,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:18:56,647 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:18:56,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-10-13 10:18:58,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:18:58,593 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:18:58,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2024-10-13 10:18:58,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e039f841d/80dbe1980fa846eab658a148f1ab4b8a/FLAG51de6ee71 [2024-10-13 10:18:58,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e039f841d/80dbe1980fa846eab658a148f1ab4b8a [2024-10-13 10:18:58,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:18:58,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:18:58,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:58,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:18:58,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:18:58,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:58" (1/1) ... [2024-10-13 10:18:58,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669838e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:58, skipping insertion in model container [2024-10-13 10:18:58,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:58" (1/1) ... [2024-10-13 10:18:58,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:59,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:59,587 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:18:59,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:59,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:59,693 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:18:59,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:59,847 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:18:59,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59 WrapperNode [2024-10-13 10:18:59,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:59,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:18:59,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:18:59,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:18:59,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:18:59,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:18:59,968 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 905 [2024-10-13 10:18:59,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:18:59,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:18:59,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:18:59,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:18:59,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:18:59,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:18:59,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,052 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-10-13 10:19:00,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:19:00,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:19:00,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:19:00,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:19:00,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (1/1) ... [2024-10-13 10:19:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:19:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:19:00,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:19:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:19:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:19:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:19:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:19:00,241 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:19:00,241 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:19:00,242 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:19:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:19:00,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:19:00,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:19:00,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:19:00,491 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:19:00,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:19:07,751 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-13 10:19:07,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:19:07,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:19:07,789 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-13 10:19:07,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:19:07 BoogieIcfgContainer [2024-10-13 10:19:07,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:19:07,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:19:07,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:19:07,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:19:07,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:18:58" (1/3) ... [2024-10-13 10:19:07,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499d2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:19:07, skipping insertion in model container [2024-10-13 10:19:07,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:59" (2/3) ... [2024-10-13 10:19:07,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3499d2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:19:07, skipping insertion in model container [2024-10-13 10:19:07,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:19:07" (3/3) ... [2024-10-13 10:19:07,799 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2024-10-13 10:19:07,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:19:07,817 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:19:07,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:19:07,883 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;@117da16d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:19:07,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:19:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 166 states have (on average 1.680722891566265) internal successors, (279), 175 states have internal predecessors, (279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:19:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:19:07,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:07,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:19:07,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:07,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1644530680, now seen corresponding path program 1 times [2024-10-13 10:19:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:07,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960912370] [2024-10-13 10:19:07,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:07,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:07,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:07,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:07,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:19:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:08,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:19:08,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:19:08,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:08,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960912370] [2024-10-13 10:19:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960912370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:19:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831110159] [2024-10-13 10:19:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:19:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:19:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:19:08,163 INFO L87 Difference]: Start difference. First operand has 182 states, 166 states have (on average 1.680722891566265) internal successors, (279), 175 states have internal predecessors, (279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-13 10:19:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:08,227 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2024-10-13 10:19:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:19:08,229 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-13 10:19:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:08,240 INFO L225 Difference]: With dead ends: 180 [2024-10-13 10:19:08,240 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 10:19:08,242 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-13 10:19:08,263 INFO L432 NwaCegarLoop]: 232 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, 232 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-13 10:19:08,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:19:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 10:19:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-13 10:19:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 172 states have internal predecessors, (217), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:19:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-13 10:19:08,319 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 6 [2024-10-13 10:19:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:08,319 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-13 10:19:08,319 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-13 10:19:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-13 10:19:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:19:08,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:08,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:08,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:19:08,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:08,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:08,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:08,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1638208640, now seen corresponding path program 1 times [2024-10-13 10:19:08,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:08,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153107710] [2024-10-13 10:19:08,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:08,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:08,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:08,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:08,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:19:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:08,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:19:08,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:08,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:08,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:08,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:08,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:19:08,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:19:08,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:19:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:19:08,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:08,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:08,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153107710] [2024-10-13 10:19:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153107710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:08,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:19:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383565210] [2024-10-13 10:19:08,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:08,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:08,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:08,880 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:09,580 INFO L93 Difference]: Finished difference Result 343 states and 456 transitions. [2024-10-13 10:19:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:19:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-13 10:19:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:09,584 INFO L225 Difference]: With dead ends: 343 [2024-10-13 10:19:09,584 INFO L226 Difference]: Without dead ends: 343 [2024-10-13 10:19:09,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:19:09,586 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:09,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 684 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:19:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-13 10:19:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 181. [2024-10-13 10:19:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.311377245508982) internal successors, (219), 174 states have internal predecessors, (219), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:19:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-13 10:19:09,618 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 8 [2024-10-13 10:19:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:09,619 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-13 10:19:09,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-13 10:19:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 10:19:09,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:09,621 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:09,629 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:09,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:09,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash 988580530, now seen corresponding path program 1 times [2024-10-13 10:19:09,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:09,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985298564] [2024-10-13 10:19:09,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:09,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:09,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:09,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:19:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:10,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:10,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:19:10,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:10,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:10,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985298564] [2024-10-13 10:19:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985298564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:10,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:19:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663864669] [2024-10-13 10:19:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:10,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:10,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:10,274 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:10,490 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2024-10-13 10:19:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:19:10,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-10-13 10:19:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:10,492 INFO L225 Difference]: With dead ends: 184 [2024-10-13 10:19:10,492 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 10:19:10,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:19:10,493 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 30 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 589 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:10,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 589 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:19:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 10:19:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-13 10:19:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 177 states have internal predecessors, (214), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 10:19:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2024-10-13 10:19:10,508 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 64 [2024-10-13 10:19:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:10,508 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2024-10-13 10:19:10,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2024-10-13 10:19:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 10:19:10,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:10,511 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:10,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:10,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:10,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:10,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1552494042, now seen corresponding path program 1 times [2024-10-13 10:19:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:10,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046842562] [2024-10-13 10:19:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:10,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:10,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:10,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:10,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:19:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:11,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:11,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:19:11,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:11,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046842562] [2024-10-13 10:19:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046842562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:19:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231549865] [2024-10-13 10:19:11,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:11,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:19:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:19:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:19:11,458 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:11,885 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2024-10-13 10:19:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:19:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2024-10-13 10:19:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:11,888 INFO L225 Difference]: With dead ends: 285 [2024-10-13 10:19:11,888 INFO L226 Difference]: Without dead ends: 285 [2024-10-13 10:19:11,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:19:11,889 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 74 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:11,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 482 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:19:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-13 10:19:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2024-10-13 10:19:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 262 states have (on average 1.2557251908396947) internal successors, (329), 274 states have internal predecessors, (329), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:19:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 357 transitions. [2024-10-13 10:19:11,909 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 357 transitions. Word has length 64 [2024-10-13 10:19:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:11,909 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 357 transitions. [2024-10-13 10:19:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:19:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 357 transitions. [2024-10-13 10:19:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 10:19:11,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:11,912 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] [2024-10-13 10:19:11,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:19:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:12,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:12,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -996994381, now seen corresponding path program 1 times [2024-10-13 10:19:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940869874] [2024-10-13 10:19:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:12,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:12,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:19:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:12,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:12,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:19:12,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:12,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940869874] [2024-10-13 10:19:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940869874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:12,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:12,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:19:12,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310512954] [2024-10-13 10:19:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:12,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:12,642 INFO L87 Difference]: Start difference. First operand 281 states and 357 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:19:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:12,749 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2024-10-13 10:19:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:19:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2024-10-13 10:19:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:12,752 INFO L225 Difference]: With dead ends: 283 [2024-10-13 10:19:12,752 INFO L226 Difference]: Without dead ends: 283 [2024-10-13 10:19:12,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-13 10:19:12,754 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:12,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:19:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-13 10:19:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-13 10:19:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 263 states have (on average 1.258555133079848) internal successors, (331), 276 states have internal predecessors, (331), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 360 transitions. [2024-10-13 10:19:12,779 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 360 transitions. Word has length 77 [2024-10-13 10:19:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:12,779 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 360 transitions. [2024-10-13 10:19:12,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:19:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 360 transitions. [2024-10-13 10:19:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 10:19:12,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:12,783 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:12,794 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:12,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:12,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:12,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1117997847, now seen corresponding path program 1 times [2024-10-13 10:19:12,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:12,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043117248] [2024-10-13 10:19:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:12,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:12,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:12,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:12,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:19:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:13,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:19:13,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:19:13,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:19:13,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043117248] [2024-10-13 10:19:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043117248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:13,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:19:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946699434] [2024-10-13 10:19:13,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:13,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:19:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:19:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:19:13,593 INFO L87 Difference]: Start difference. First operand 283 states and 360 transitions. Second operand has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:13,817 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2024-10-13 10:19:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:19:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 79 [2024-10-13 10:19:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:13,820 INFO L225 Difference]: With dead ends: 292 [2024-10-13 10:19:13,820 INFO L226 Difference]: Without dead ends: 292 [2024-10-13 10:19:13,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 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-13 10:19:13,822 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 4 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:13,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 654 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:19:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-13 10:19:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-10-13 10:19:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 270 states have (on average 1.2740740740740741) internal successors, (344), 283 states have internal predecessors, (344), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 373 transitions. [2024-10-13 10:19:13,837 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 373 transitions. Word has length 79 [2024-10-13 10:19:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:13,838 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 373 transitions. [2024-10-13 10:19:13,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 373 transitions. [2024-10-13 10:19:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 10:19:13,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:13,842 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 10:19:13,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:14,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:14,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:14,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2090033363, now seen corresponding path program 2 times [2024-10-13 10:19:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:14,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42680104] [2024-10-13 10:19:14,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:14,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:14,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:19:14,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:19:14,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:14,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:19:14,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:14,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:14,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:14,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:19:14,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:19:14,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:19:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:19:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:19:14,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:14,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42680104] [2024-10-13 10:19:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42680104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:19:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309863728] [2024-10-13 10:19:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:14,454 INFO L87 Difference]: Start difference. First operand 291 states and 373 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:19:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:14,926 INFO L93 Difference]: Finished difference Result 427 states and 564 transitions. [2024-10-13 10:19:14,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:19:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-10-13 10:19:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:14,929 INFO L225 Difference]: With dead ends: 427 [2024-10-13 10:19:14,929 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 10:19:14,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:19:14,930 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 186 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:14,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 597 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:19:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 10:19:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 293. [2024-10-13 10:19:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2720588235294117) internal successors, (346), 285 states have internal predecessors, (346), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 375 transitions. [2024-10-13 10:19:14,940 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 375 transitions. Word has length 83 [2024-10-13 10:19:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 375 transitions. [2024-10-13 10:19:14,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:19:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 375 transitions. [2024-10-13 10:19:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 10:19:14,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:14,946 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 10:19:14,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:15,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash 912389037, now seen corresponding path program 1 times [2024-10-13 10:19:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712272826] [2024-10-13 10:19:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:15,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:15,152 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:19:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:15,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:19:15,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:19:15,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:19:16,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712272826] [2024-10-13 10:19:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712272826] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:16,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:16,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:19:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281840275] [2024-10-13 10:19:16,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:16,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:19:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:19:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:19:16,212 INFO L87 Difference]: Start difference. First operand 293 states and 375 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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-13 10:19:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:16,984 INFO L93 Difference]: Finished difference Result 305 states and 394 transitions. [2024-10-13 10:19:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:19:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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 122 [2024-10-13 10:19:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:16,988 INFO L225 Difference]: With dead ends: 305 [2024-10-13 10:19:16,989 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 10:19:16,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:19:16,990 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 8 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:16,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1301 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:19:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 10:19:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2024-10-13 10:19:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2740213523131672) internal successors, (358), 294 states have internal predecessors, (358), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 387 transitions. [2024-10-13 10:19:17,005 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 387 transitions. Word has length 122 [2024-10-13 10:19:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 387 transitions. [2024-10-13 10:19:17,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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-13 10:19:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 387 transitions. [2024-10-13 10:19:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:19:17,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:17,007 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-13 10:19:17,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:19:17,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:17,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:17,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash -413171410, now seen corresponding path program 2 times [2024-10-13 10:19:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86249461] [2024-10-13 10:19:17,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:17,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:17,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:19:17,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:19:17,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:17,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:17,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-13 10:19:17,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:17,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:17,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86249461] [2024-10-13 10:19:17,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86249461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:17,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:17,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:19:17,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788951611] [2024-10-13 10:19:17,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:17,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:17,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:17,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:17,561 INFO L87 Difference]: Start difference. First operand 302 states and 387 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-13 10:19:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:17,748 INFO L93 Difference]: Finished difference Result 308 states and 377 transitions. [2024-10-13 10:19:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:19:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 131 [2024-10-13 10:19:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:17,750 INFO L225 Difference]: With dead ends: 308 [2024-10-13 10:19:17,750 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 10:19:17,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:19:17,751 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 30 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 556 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:17,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 556 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:19:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 10:19:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-13 10:19:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 287 states have (on average 1.2125435540069687) internal successors, (348), 300 states have internal predecessors, (348), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 377 transitions. [2024-10-13 10:19:17,760 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 377 transitions. Word has length 131 [2024-10-13 10:19:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 377 transitions. [2024-10-13 10:19:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-13 10:19:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 377 transitions. [2024-10-13 10:19:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:19:17,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:17,763 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-13 10:19:17,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:19:17,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:17,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:17,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash 936758434, now seen corresponding path program 1 times [2024-10-13 10:19:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:17,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497943497] [2024-10-13 10:19:17,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:17,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:17,972 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:17,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:19:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:18,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:19:18,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:19:18,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:19:19,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:19,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497943497] [2024-10-13 10:19:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497943497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:19,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:19:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752821641] [2024-10-13 10:19:19,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:19,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:19:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:19:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:19:19,399 INFO L87 Difference]: Start difference. First operand 308 states and 377 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-13 10:19:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:21,431 INFO L93 Difference]: Finished difference Result 329 states and 414 transitions. [2024-10-13 10:19:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:19:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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 131 [2024-10-13 10:19:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:21,434 INFO L225 Difference]: With dead ends: 329 [2024-10-13 10:19:21,434 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 10:19:21,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:19:21,436 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:21,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2669 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 10:19:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 10:19:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 326. [2024-10-13 10:19:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.219672131147541) internal successors, (372), 318 states have internal predecessors, (372), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 401 transitions. [2024-10-13 10:19:21,447 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 401 transitions. Word has length 131 [2024-10-13 10:19:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:21,447 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 401 transitions. [2024-10-13 10:19:21,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-13 10:19:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 401 transitions. [2024-10-13 10:19:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 10:19:21,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:21,450 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-13 10:19:21,465 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-13 10:19:21,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:21,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1041148158, now seen corresponding path program 2 times [2024-10-13 10:19:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134284782] [2024-10-13 10:19:21,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:21,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:21,654 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:21,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:19:22,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:19:22,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:22,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:19:22,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-13 10:19:22,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:22,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:22,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134284782] [2024-10-13 10:19:22,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134284782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:19:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675832387] [2024-10-13 10:19:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:22,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:19:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:19:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:19:22,085 INFO L87 Difference]: Start difference. First operand 326 states and 401 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-13 10:19:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:22,182 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2024-10-13 10:19:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:19:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 149 [2024-10-13 10:19:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:22,184 INFO L225 Difference]: With dead ends: 326 [2024-10-13 10:19:22,184 INFO L226 Difference]: Without dead ends: 326 [2024-10-13 10:19:22,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:19:22,184 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:22,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:19:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-13 10:19:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-10-13 10:19:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.2) internal successors, (366), 318 states have internal predecessors, (366), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 395 transitions. [2024-10-13 10:19:22,195 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 395 transitions. Word has length 149 [2024-10-13 10:19:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 395 transitions. [2024-10-13 10:19:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-13 10:19:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 395 transitions. [2024-10-13 10:19:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 10:19:22,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:22,199 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-13 10:19:22,205 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-13 10:19:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:22,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -20079804, now seen corresponding path program 1 times [2024-10-13 10:19:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:22,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308227857] [2024-10-13 10:19:22,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:22,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:22,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:22,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:19:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:23,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:19:23,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 10:19:23,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 10:19:25,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308227857] [2024-10-13 10:19:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308227857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:25,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:19:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59016719] [2024-10-13 10:19:25,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:19:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:19:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:19:25,300 INFO L87 Difference]: Start difference. First operand 326 states and 395 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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-13 10:19:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:31,973 INFO L93 Difference]: Finished difference Result 363 states and 464 transitions. [2024-10-13 10:19:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:19:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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 149 [2024-10-13 10:19:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:31,976 INFO L225 Difference]: With dead ends: 363 [2024-10-13 10:19:31,976 INFO L226 Difference]: Without dead ends: 361 [2024-10-13 10:19:31,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:19:31,979 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 26 mSDsluCounter, 4922 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:31,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5130 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 10:19:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-13 10:19:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2024-10-13 10:19:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 352 states have internal predecessors, (412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 441 transitions. [2024-10-13 10:19:31,988 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 441 transitions. Word has length 149 [2024-10-13 10:19:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 441 transitions. [2024-10-13 10:19:31,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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-13 10:19:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 441 transitions. [2024-10-13 10:19:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 10:19:31,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:31,990 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-13 10:19:32,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:19:32,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:32,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:32,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 336867044, now seen corresponding path program 2 times [2024-10-13 10:19:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900745269] [2024-10-13 10:19:32,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:32,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:32,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:32,194 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:32,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:19:33,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:19:33,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:33,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:19:33,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:19:33,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:19:35,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900745269] [2024-10-13 10:19:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900745269] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:35,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:19:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47215848] [2024-10-13 10:19:35,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:35,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:19:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:35,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:19:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:19:35,763 INFO L87 Difference]: Start difference. First operand 360 states and 441 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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-13 10:19:42,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:42,013 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2024-10-13 10:19:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:19:42,013 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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 183 [2024-10-13 10:19:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:42,015 INFO L225 Difference]: With dead ends: 387 [2024-10-13 10:19:42,015 INFO L226 Difference]: Without dead ends: 387 [2024-10-13 10:19:42,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:19:42,018 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 27 mSDsluCounter, 5103 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:42,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5310 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 10:19:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-13 10:19:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2024-10-13 10:19:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 364 states have (on average 1.2692307692307692) internal successors, (462), 377 states have internal predecessors, (462), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 491 transitions. [2024-10-13 10:19:42,028 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 491 transitions. Word has length 183 [2024-10-13 10:19:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 491 transitions. [2024-10-13 10:19:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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-13 10:19:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 491 transitions. [2024-10-13 10:19:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 10:19:42,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:42,031 INFO L215 NwaCegarLoop]: trace histogram [92, 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] [2024-10-13 10:19:42,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:19:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:42,231 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1664704451, now seen corresponding path program 3 times [2024-10-13 10:19:42,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217942443] [2024-10-13 10:19:42,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:19:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:42,234 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:42,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:19:42,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:19:42,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:42,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:42,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-13 10:19:43,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:19:43,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217942443] [2024-10-13 10:19:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217942443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:19:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:19:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:19:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693109277] [2024-10-13 10:19:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:19:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:19:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:19:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:19:43,068 INFO L87 Difference]: Start difference. First operand 385 states and 491 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-13 10:19:47,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:19:51,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:19:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:52,551 INFO L93 Difference]: Finished difference Result 327 states and 418 transitions. [2024-10-13 10:19:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:19:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 208 [2024-10-13 10:19:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:52,553 INFO L225 Difference]: With dead ends: 327 [2024-10-13 10:19:52,554 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 10:19:52,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:19:52,554 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 263 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:52,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 289 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2024-10-13 10:19:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 10:19:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-10-13 10:19:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 311 states have (on average 1.2829581993569132) internal successors, (399), 319 states have internal predecessors, (399), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-13 10:19:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 418 transitions. [2024-10-13 10:19:52,561 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 418 transitions. Word has length 208 [2024-10-13 10:19:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:52,562 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 418 transitions. [2024-10-13 10:19:52,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-13 10:19:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 418 transitions. [2024-10-13 10:19:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 10:19:52,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:52,565 INFO L215 NwaCegarLoop]: trace histogram [92, 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] [2024-10-13 10:19:52,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:19:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:52,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1660407181, now seen corresponding path program 1 times [2024-10-13 10:19:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:52,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197573774] [2024-10-13 10:19:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:52,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:19:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:52,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:19:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:19:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:54,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:19:54,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:19:56,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:20:03,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:03,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197573774] [2024-10-13 10:20:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197573774] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:03,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:03,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:20:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317088736] [2024-10-13 10:20:03,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:03,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:20:03,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:20:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:20:03,495 INFO L87 Difference]: Start difference. First operand 327 states and 418 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 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)