./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_FNV_test5-3.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_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:13:12,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:13:12,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:13:12,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:13:12,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:13:12,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:13:12,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:13:12,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:13:12,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:13:12,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:13:12,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:13:12,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:13:12,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:13:12,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:13:12,121 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:13:12,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:13:12,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:13:12,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:13:12,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:13:12,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:13:12,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:13:12,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:13:12,126 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:13:12,126 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:13:12,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:13:12,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:13:12,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:13:12,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:13:12,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:13:12,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:13:12,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:13:12,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:13:12,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:13:12,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:13:12,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:13:12,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:13:12,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:13:12,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:13:12,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:13:12,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:13:12,132 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-10-13 10:13:12,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:13:12,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:13:12,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:13:12,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:13:12,411 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:13:12,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-13 10:13:13,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:13:13,999 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:13:14,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-13 10:13:14,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140783311/c649f22f040644c7bb19fbcfe7826521/FLAG46c65d6c4 [2024-10-13 10:13:14,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/140783311/c649f22f040644c7bb19fbcfe7826521 [2024-10-13 10:13:14,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:13:14,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:13:14,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:13:14,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:13:14,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:13:14,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:13:14" (1/1) ... [2024-10-13 10:13:14,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad23d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:14, skipping insertion in model container [2024-10-13 10:13:14,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:13:14" (1/1) ... [2024-10-13 10:13:14,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:13:14,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:13:14,853 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:13:14,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ff6b890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:14, skipping insertion in model container [2024-10-13 10:13:14,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:13:14,854 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:13:14,856 INFO L158 Benchmark]: Toolchain (without parser) took 542.56ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 77.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 10:13:14,856 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 78.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:13:14,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.11ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 77.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 10:13:14,858 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.12ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 78.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.11ms. Allocated memory is still 174.1MB. Free memory was 102.9MB in the beginning and 77.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:13:16,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:13:16,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:13:16,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:13:16,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:13:16,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:13:16,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:13:16,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:13:16,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:13:16,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:13:16,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:13:16,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:13:16,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:13:16,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:13:16,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:13:16,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:13:16,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:13:16,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:13:16,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:13:16,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:13:16,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:13:16,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:13:16,758 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:13:16,758 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:13:16,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:13:16,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:13:16,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:13:16,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:13:16,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:13:16,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:13:16,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:13:16,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:13:16,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:13:16,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:13:16,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:13:16,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:13:16,763 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:13:16,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:13:16,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:13:16,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:13:16,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:13:16,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:13:16,764 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:13:16,764 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-10-13 10:13:17,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:13:17,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:13:17,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:13:17,104 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:13:17,104 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:13:17,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-13 10:13:18,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:13:18,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:13:18,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-13 10:13:18,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c16c8853/8c55b61c7843422583245043d72ae898/FLAGef04d8fb2 [2024-10-13 10:13:18,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c16c8853/8c55b61c7843422583245043d72ae898 [2024-10-13 10:13:18,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:13:18,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:13:18,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:13:18,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:13:18,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:13:18,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:13:18" (1/1) ... [2024-10-13 10:13:18,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e1995f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:18, skipping insertion in model container [2024-10-13 10:13:18,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:13:18" (1/1) ... [2024-10-13 10:13:18,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:13:19,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:13:19,427 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:13:19,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:13:19,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:13:19,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:13:19,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:13:19,680 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:13:19,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19 WrapperNode [2024-10-13 10:13:19,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:13:19,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:13:19,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:13:19,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:13:19,687 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:13:19" (1/1) ... [2024-10-13 10:13:19,728 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:13:19" (1/1) ... [2024-10-13 10:13:19,811 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728 [2024-10-13 10:13:19,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:13:19,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:13:19,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:13:19,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:13:19,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:19,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:19,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:19,950 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2024-10-13 10:13:19,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:19,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:19,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:20,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:20,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:20,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:20,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:13:20,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:13:20,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:13:20,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:13:20,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (1/1) ... [2024-10-13 10:13:20,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:13:20,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:13:20,074 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:13:20,079 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:13:20,117 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:13:20,117 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:13:20,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:13:20,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:13:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:13:20,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:13:20,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:13:20,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:13:20,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:13:20,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:13:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:13:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:13:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:13:20,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:13:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:13:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:13:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:13:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:13:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:13:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:13:20,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:13:20,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:13:34,457 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2024-10-13 10:13:34,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:13:34,503 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:13:34,504 INFO L314 CfgBuilder]: Removed 100 assume(true) statements. [2024-10-13 10:13:34,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:13:34 BoogieIcfgContainer [2024-10-13 10:13:34,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:13:34,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:13:34,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:13:34,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:13:34,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:13:18" (1/3) ... [2024-10-13 10:13:34,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d66922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:13:34, skipping insertion in model container [2024-10-13 10:13:34,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:13:19" (2/3) ... [2024-10-13 10:13:34,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d66922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:13:34, skipping insertion in model container [2024-10-13 10:13:34,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:13:34" (3/3) ... [2024-10-13 10:13:34,514 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-10-13 10:13:34,531 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:13:34,531 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:13:34,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:13:34,590 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;@4bd3e6e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:13:34,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:13:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 299 states have (on average 1.6822742474916388) internal successors, (503), 308 states have internal predecessors, (503), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:13:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:13:34,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:34,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:34,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1408030666, now seen corresponding path program 1 times [2024-10-13 10:13:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725817893] [2024-10-13 10:13:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:34,623 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:13:34,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:34,625 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:13:34,640 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:13:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:34,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:13:34,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:34,860 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:13:34,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:34,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725817893] [2024-10-13 10:13:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725817893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:13:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543661945] [2024-10-13 10:13:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:34,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:13:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:13:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:13:34,900 INFO L87 Difference]: Start difference. First operand has 318 states, 299 states have (on average 1.6822742474916388) internal successors, (503), 308 states have internal predecessors, (503), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:34,979 INFO L93 Difference]: Finished difference Result 316 states and 417 transitions. [2024-10-13 10:13:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:13:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:13:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:35,012 INFO L225 Difference]: With dead ends: 316 [2024-10-13 10:13:35,016 INFO L226 Difference]: Without dead ends: 315 [2024-10-13 10:13:35,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:13:35,026 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:35,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:13:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-13 10:13:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-13 10:13:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 305 states have internal predecessors, (392), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:13:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2024-10-13 10:13:35,105 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 416 transitions. Word has length 9 [2024-10-13 10:13:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:35,124 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 416 transitions. [2024-10-13 10:13:35,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 416 transitions. [2024-10-13 10:13:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:13:35,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:35,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:35,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:13:35,330 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:13:35,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:35,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1581269798, now seen corresponding path program 1 times [2024-10-13 10:13:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:35,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924004261] [2024-10-13 10:13:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:35,332 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:13:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:35,335 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:13:35,336 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:13:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:35,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:13:35,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:35,502 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:13:35,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:35,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924004261] [2024-10-13 10:13:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924004261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:13:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29386596] [2024-10-13 10:13:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:35,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:13:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:13:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:13:35,506 INFO L87 Difference]: Start difference. First operand 315 states and 416 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:35,722 INFO L93 Difference]: Finished difference Result 561 states and 744 transitions. [2024-10-13 10:13:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:13:35,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:13:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:35,727 INFO L225 Difference]: With dead ends: 561 [2024-10-13 10:13:35,727 INFO L226 Difference]: Without dead ends: 561 [2024-10-13 10:13:35,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:13:35,728 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 303 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 840 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:35,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 840 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:13:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-13 10:13:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 317. [2024-10-13 10:13:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 300 states have (on average 1.3133333333333332) internal successors, (394), 307 states have internal predecessors, (394), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:13:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 418 transitions. [2024-10-13 10:13:35,755 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 418 transitions. Word has length 10 [2024-10-13 10:13:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:35,755 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 418 transitions. [2024-10-13 10:13:35,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 418 transitions. [2024-10-13 10:13:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 10:13:35,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:35,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:35,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:13:35,967 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:13:35,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:35,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1412388192, now seen corresponding path program 1 times [2024-10-13 10:13:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:35,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612339765] [2024-10-13 10:13:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:35,970 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:13:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:35,973 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:13:35,974 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:13:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:36,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:36,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:13:36,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:36,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612339765] [2024-10-13 10:13:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612339765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:36,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:36,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099616445] [2024-10-13 10:13:36,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:36,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:36,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:36,643 INFO L87 Difference]: Start difference. First operand 317 states and 418 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:36,793 INFO L93 Difference]: Finished difference Result 320 states and 413 transitions. [2024-10-13 10:13:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-10-13 10:13:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:36,795 INFO L225 Difference]: With dead ends: 320 [2024-10-13 10:13:36,795 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 10:13:36,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:36,796 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 30 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:36,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1129 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 10:13:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-10-13 10:13:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 303 states have (on average 1.283828382838284) internal successors, (389), 310 states have internal predecessors, (389), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:13:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 413 transitions. [2024-10-13 10:13:36,807 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 413 transitions. Word has length 151 [2024-10-13 10:13:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 413 transitions. [2024-10-13 10:13:36,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 413 transitions. [2024-10-13 10:13:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 10:13:36,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:36,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:36,823 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:13:37,010 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:13:37,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1506775084, now seen corresponding path program 1 times [2024-10-13 10:13:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746638097] [2024-10-13 10:13:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:37,013 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:13:37,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:37,015 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:13:37,016 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:13:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:37,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:37,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:13:37,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:37,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746638097] [2024-10-13 10:13:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746638097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:37,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:13:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176151514] [2024-10-13 10:13:37,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:37,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:13:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:13:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:13:37,833 INFO L87 Difference]: Start difference. First operand 320 states and 413 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:38,267 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2024-10-13 10:13:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:13:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-10-13 10:13:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:38,269 INFO L225 Difference]: With dead ends: 415 [2024-10-13 10:13:38,269 INFO L226 Difference]: Without dead ends: 415 [2024-10-13 10:13:38,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:13:38,270 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 72 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:38,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 805 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:13:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-13 10:13:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 362. [2024-10-13 10:13:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 345 states have (on average 1.2608695652173914) internal successors, (435), 352 states have internal predecessors, (435), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:13:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2024-10-13 10:13:38,281 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 151 [2024-10-13 10:13:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:38,282 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2024-10-13 10:13:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:13:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2024-10-13 10:13:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 10:13:38,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:38,285 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:38,298 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:13:38,485 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:13:38,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:38,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 206796108, now seen corresponding path program 1 times [2024-10-13 10:13:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143087330] [2024-10-13 10:13:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:38,488 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:13:38,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:38,491 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:13:38,493 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:13:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:39,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:39,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:13:39,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:39,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143087330] [2024-10-13 10:13:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143087330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484377816] [2024-10-13 10:13:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:39,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:39,150 INFO L87 Difference]: Start difference. First operand 362 states and 459 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:13:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:39,220 INFO L93 Difference]: Finished difference Result 364 states and 463 transitions. [2024-10-13 10:13:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:13:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 164 [2024-10-13 10:13:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:39,222 INFO L225 Difference]: With dead ends: 364 [2024-10-13 10:13:39,222 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 10:13:39,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:39,223 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 0 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:39,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1187 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 10:13:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-13 10:13:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 346 states have (on average 1.2630057803468209) internal successors, (437), 354 states have internal predecessors, (437), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 463 transitions. [2024-10-13 10:13:39,240 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 463 transitions. Word has length 164 [2024-10-13 10:13:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:39,240 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 463 transitions. [2024-10-13 10:13:39,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:13:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 463 transitions. [2024-10-13 10:13:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 10:13:39,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:39,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:39,262 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:13:39,446 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:13:39,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:39,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash 540844976, now seen corresponding path program 1 times [2024-10-13 10:13:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556501028] [2024-10-13 10:13:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:39,449 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:13:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:39,450 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:13:39,451 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:13:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:40,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:13:40,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:13:40,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:13:40,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556501028] [2024-10-13 10:13:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556501028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:40,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:13:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557431187] [2024-10-13 10:13:40,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:40,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:13:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:13:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:13:40,167 INFO L87 Difference]: Start difference. First operand 364 states and 463 transitions. Second operand has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:40,356 INFO L93 Difference]: Finished difference Result 373 states and 478 transitions. [2024-10-13 10:13:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:13:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 166 [2024-10-13 10:13:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:40,358 INFO L225 Difference]: With dead ends: 373 [2024-10-13 10:13:40,359 INFO L226 Difference]: Without dead ends: 373 [2024-10-13 10:13:40,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:13:40,359 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 4 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:40,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1576 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-13 10:13:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2024-10-13 10:13:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 353 states have (on average 1.274787535410765) internal successors, (450), 361 states have internal predecessors, (450), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 476 transitions. [2024-10-13 10:13:40,373 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 476 transitions. Word has length 166 [2024-10-13 10:13:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:40,375 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 476 transitions. [2024-10-13 10:13:40,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 476 transitions. [2024-10-13 10:13:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 10:13:40,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:40,377 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:40,396 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:13:40,578 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:13:40,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash -482685716, now seen corresponding path program 2 times [2024-10-13 10:13:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:40,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162770249] [2024-10-13 10:13:40,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:13:40,580 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:13:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:40,582 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:13:40,583 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:13:40,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:13:40,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:40,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:40,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 10:13:40,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:40,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:40,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162770249] [2024-10-13 10:13:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162770249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:40,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:40,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119342767] [2024-10-13 10:13:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:40,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:40,930 INFO L87 Difference]: Start difference. First operand 372 states and 476 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:41,039 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2024-10-13 10:13:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-13 10:13:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:41,042 INFO L225 Difference]: With dead ends: 375 [2024-10-13 10:13:41,042 INFO L226 Difference]: Without dead ends: 375 [2024-10-13 10:13:41,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:41,043 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 33 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:41,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1093 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-13 10:13:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-13 10:13:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 356 states have (on average 1.25) internal successors, (445), 364 states have internal predecessors, (445), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 471 transitions. [2024-10-13 10:13:41,052 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 471 transitions. Word has length 170 [2024-10-13 10:13:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 471 transitions. [2024-10-13 10:13:41,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 471 transitions. [2024-10-13 10:13:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 10:13:41,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:41,055 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:41,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:13:41,255 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:13:41,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:41,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2125336678, now seen corresponding path program 1 times [2024-10-13 10:13:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211615218] [2024-10-13 10:13:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:41,257 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:13:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:41,258 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:13:41,259 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:13:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:41,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:13:41,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:13:41,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:13:42,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211615218] [2024-10-13 10:13:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211615218] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:42,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:13:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124024322] [2024-10-13 10:13:42,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:42,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:13:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:42,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:13:42,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:13:42,048 INFO L87 Difference]: Start difference. First operand 375 states and 471 transitions. Second operand has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:42,529 INFO L93 Difference]: Finished difference Result 387 states and 491 transitions. [2024-10-13 10:13:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:13:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 170 [2024-10-13 10:13:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:42,531 INFO L225 Difference]: With dead ends: 387 [2024-10-13 10:13:42,531 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 10:13:42,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:13:42,532 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 8 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:42,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2679 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:13:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 10:13:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2024-10-13 10:13:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 365 states have (on average 1.252054794520548) internal successors, (457), 373 states have internal predecessors, (457), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 483 transitions. [2024-10-13 10:13:42,539 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 483 transitions. Word has length 170 [2024-10-13 10:13:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 483 transitions. [2024-10-13 10:13:42,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 483 transitions. [2024-10-13 10:13:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 10:13:42,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:42,541 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:42,555 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:13:42,741 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:13:42,742 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:42,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -432570703, now seen corresponding path program 2 times [2024-10-13 10:13:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:42,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144561933] [2024-10-13 10:13:42,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:13:42,744 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:13:42,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:42,747 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:13:42,748 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:13:43,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:13:43,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:43,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:13:43,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-13 10:13:43,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:43,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144561933] [2024-10-13 10:13:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144561933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:13:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613765705] [2024-10-13 10:13:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:13:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:13:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:43,176 INFO L87 Difference]: Start difference. First operand 384 states and 483 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:43,273 INFO L93 Difference]: Finished difference Result 378 states and 473 transitions. [2024-10-13 10:13:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 179 [2024-10-13 10:13:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:43,275 INFO L225 Difference]: With dead ends: 378 [2024-10-13 10:13:43,276 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 10:13:43,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:43,276 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 6 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:43,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1093 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 10:13:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-10-13 10:13:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.2451253481894151) internal successors, (447), 367 states have internal predecessors, (447), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 473 transitions. [2024-10-13 10:13:43,290 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 473 transitions. Word has length 179 [2024-10-13 10:13:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 473 transitions. [2024-10-13 10:13:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 473 transitions. [2024-10-13 10:13:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-13 10:13:43,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:43,293 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:43,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:13:43,494 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:13:43,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:43,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash -894676489, now seen corresponding path program 1 times [2024-10-13 10:13:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644186796] [2024-10-13 10:13:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:43,497 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:13:43,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:43,498 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:13:43,499 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:13:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:44,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:13:44,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:13:44,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:13:44,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644186796] [2024-10-13 10:13:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644186796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:44,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:44,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:13:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637911975] [2024-10-13 10:13:44,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:44,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:13:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:44,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:13:44,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:13:44,711 INFO L87 Difference]: Start difference. First operand 378 states and 473 transitions. Second operand has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:46,332 INFO L93 Difference]: Finished difference Result 399 states and 511 transitions. [2024-10-13 10:13:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:13:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 179 [2024-10-13 10:13:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:46,334 INFO L225 Difference]: With dead ends: 399 [2024-10-13 10:13:46,334 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 10:13:46,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:13:46,336 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 14 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:46,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4543 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:13:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 10:13:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 396. [2024-10-13 10:13:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 377 states have (on average 1.2493368700265253) internal successors, (471), 385 states have internal predecessors, (471), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 497 transitions. [2024-10-13 10:13:46,343 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 497 transitions. Word has length 179 [2024-10-13 10:13:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:46,344 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 497 transitions. [2024-10-13 10:13:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 497 transitions. [2024-10-13 10:13:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 10:13:46,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:46,345 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:46,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:13:46,549 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:13:46,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:46,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash 43693847, now seen corresponding path program 2 times [2024-10-13 10:13:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323575986] [2024-10-13 10:13:46,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:13:46,551 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:13:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:46,552 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:13:46,554 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:13:47,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:13:47,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:47,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:13:47,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 10:13:47,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 10:13:49,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323575986] [2024-10-13 10:13:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323575986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:49,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:13:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279554772] [2024-10-13 10:13:49,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:49,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:13:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:49,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:13:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:13:49,061 INFO L87 Difference]: Start difference. First operand 396 states and 497 transitions. Second operand has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:55,118 INFO L93 Difference]: Finished difference Result 433 states and 567 transitions. [2024-10-13 10:13:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:13:55,120 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2024-10-13 10:13:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:55,122 INFO L225 Difference]: With dead ends: 433 [2024-10-13 10:13:55,124 INFO L226 Difference]: Without dead ends: 431 [2024-10-13 10:13:55,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:13:55,127 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 25 mSDsluCounter, 9072 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9454 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:55,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9454 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 10:13:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-13 10:13:55,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 430. [2024-10-13 10:13:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 411 states have (on average 1.2579075425790753) internal successors, (517), 419 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 543 transitions. [2024-10-13 10:13:55,137 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 543 transitions. Word has length 197 [2024-10-13 10:13:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:55,137 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 543 transitions. [2024-10-13 10:13:55,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:13:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 543 transitions. [2024-10-13 10:13:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-13 10:13:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:55,140 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:55,158 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:13:55,340 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:13:55,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -760000585, now seen corresponding path program 3 times [2024-10-13 10:13:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904971296] [2024-10-13 10:13:55,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:13:55,342 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:13:55,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:55,344 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:13:55,344 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:13:56,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:13:56,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:13:56,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:13:56,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-13 10:13:56,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:13:56,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904971296] [2024-10-13 10:13:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904971296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:13:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:13:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:13:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742308616] [2024-10-13 10:13:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:13:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:13:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:13:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:13:56,074 INFO L87 Difference]: Start difference. First operand 430 states and 543 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:13:56,201 INFO L93 Difference]: Finished difference Result 433 states and 538 transitions. [2024-10-13 10:13:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:13:56,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-13 10:13:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:13:56,203 INFO L225 Difference]: With dead ends: 433 [2024-10-13 10:13:56,203 INFO L226 Difference]: Without dead ends: 433 [2024-10-13 10:13:56,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:13:56,204 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 30 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:13:56,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1051 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:13:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-13 10:13:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-10-13 10:13:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 414 states have (on average 1.2367149758454106) internal successors, (512), 422 states have internal predecessors, (512), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:13:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 538 transitions. [2024-10-13 10:13:56,211 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 538 transitions. Word has length 231 [2024-10-13 10:13:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:13:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 538 transitions. [2024-10-13 10:13:56,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:13:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 538 transitions. [2024-10-13 10:13:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-13 10:13:56,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:13:56,213 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:13:56,228 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:13:56,414 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:13:56,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:13:56,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:13:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash 744632771, now seen corresponding path program 1 times [2024-10-13 10:13:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:13:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292548795] [2024-10-13 10:13:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:13:56,415 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:13:56,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:13:56,418 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:13:56,418 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:13:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:13:57,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:13:57,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:13:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:13:58,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:13:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:13:59,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:13:59,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292548795] [2024-10-13 10:13:59,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292548795] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:13:59,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:13:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:13:59,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996958838] [2024-10-13 10:13:59,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:13:59,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:13:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:13:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:13:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:13:59,483 INFO L87 Difference]: Start difference. First operand 433 states and 538 transitions. Second operand has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:14:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:14:05,963 INFO L93 Difference]: Finished difference Result 460 states and 592 transitions. [2024-10-13 10:14:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:14:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2024-10-13 10:14:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:14:05,966 INFO L225 Difference]: With dead ends: 460 [2024-10-13 10:14:05,966 INFO L226 Difference]: Without dead ends: 460 [2024-10-13 10:14:05,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:14:05,968 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 26 mSDsluCounter, 9863 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:14:05,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10233 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 10:14:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-13 10:14:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2024-10-13 10:14:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 439 states have (on average 1.2801822323462415) internal successors, (562), 447 states have internal predecessors, (562), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-13 10:14:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 588 transitions. [2024-10-13 10:14:05,977 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 588 transitions. Word has length 231 [2024-10-13 10:14:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:14:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 588 transitions. [2024-10-13 10:14:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:14:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 588 transitions. [2024-10-13 10:14:05,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-13 10:14:05,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:14:05,978 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:14:06,007 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:14:06,179 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:14:06,179 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:14:06,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:14:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1516613260, now seen corresponding path program 2 times [2024-10-13 10:14:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:14:06,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035882466] [2024-10-13 10:14:06,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:14:06,181 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:14:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:14:06,182 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:14:06,183 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:14:08,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:14:08,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:14:08,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:14:08,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:14:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:14:09,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:14:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:14:15,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:14:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035882466] [2024-10-13 10:14:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035882466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:14:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:14:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:14:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531606800] [2024-10-13 10:14:15,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:14:15,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:14:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:14:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:14:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:14:15,144 INFO L87 Difference]: Start difference. First operand 458 states and 588 transitions. Second operand has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)