./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:20:10,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:20:10,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:20:10,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:20:10,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:20:10,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:20:10,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:20:10,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:20:10,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:20:10,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:20:10,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:20:10,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:20:10,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:20:10,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:20:10,774 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:20:10,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:20:10,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:20:10,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:20:10,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:20:10,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:20:10,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:20:10,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:20:10,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:20:10,779 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:20:10,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:20:10,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:20:10,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:20:10,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:20:10,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:20:10,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:20:10,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:20:10,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:20:10,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:20:10,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:20:10,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:20:10,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:20:10,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:10,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:20:10,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:20:10,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:20:10,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:20:10,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:20:10,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:20:10,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:20:10,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:20:10,785 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-10-13 10:20:11,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:20:11,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:20:11,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:20:11,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:20:11,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:20:11,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-13 10:20:12,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:20:12,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:20:12,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-13 10:20:13,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1a67556/13b74e4bc91e4ec9b6c3f2cae0f53e0c/FLAG0c62de3ed [2024-10-13 10:20:13,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1a67556/13b74e4bc91e4ec9b6c3f2cae0f53e0c [2024-10-13 10:20:13,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:20:13,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:20:13,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:13,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:20:13,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:20:13,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:13" (1/1) ... [2024-10-13 10:20:13,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:13, skipping insertion in model container [2024-10-13 10:20:13,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:13" (1/1) ... [2024-10-13 10:20:13,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:13,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:13,758 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:20:13,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30ad8822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:13, skipping insertion in model container [2024-10-13 10:20:13,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:13,759 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:20:13,763 INFO L158 Benchmark]: Toolchain (without parser) took 738.58ms. Allocated memory is still 169.9MB. Free memory was 104.9MB in the beginning and 124.5MB in the end (delta: -19.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:20:13,763 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 100.7MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:20:13,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.87ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 124.5MB in the end (delta: -19.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 10:20:13,765 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.28ms. Allocated memory is still 100.7MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.87ms. Allocated memory is still 169.9MB. Free memory was 104.5MB in the beginning and 124.5MB in the end (delta: -19.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.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 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:20:15,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:20:16,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:20:16,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:20:16,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:20:16,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:20:16,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:20:16,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:20:16,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:20:16,046 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:20:16,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:20:16,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:20:16,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:20:16,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:20:16,053 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:20:16,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:20:16,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:20:16,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:20:16,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:20:16,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:20:16,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:20:16,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:20:16,056 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:20:16,056 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:20:16,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:20:16,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:20:16,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:20:16,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:20:16,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:20:16,058 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:20:16,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:20:16,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:20:16,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:20:16,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:20:16,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:20:16,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:20:16,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:20:16,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:20:16,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:16,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:20:16,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:20:16,062 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:20:16,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:20:16,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:20:16,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:20:16,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:20:16,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:20:16,064 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:20:16,064 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 -> 3011b5baaaedb6c621e2913d841379eae3b8a9da7212e43b784fc8c1004eda96 [2024-10-13 10:20:16,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:20:16,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:20:16,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:20:16,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:20:16,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:20:16,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-13 10:20:17,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:20:18,299 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:20:18,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-2.i [2024-10-13 10:20:18,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5243520ef/9bd12bcc8b444fa287c3ecc67b3f42f2/FLAG924743dba [2024-10-13 10:20:18,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5243520ef/9bd12bcc8b444fa287c3ecc67b3f42f2 [2024-10-13 10:20:18,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:20:18,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:20:18,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:18,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:20:18,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:20:18,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:18" (1/1) ... [2024-10-13 10:20:18,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dba93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:18, skipping insertion in model container [2024-10-13 10:20:18,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:18" (1/1) ... [2024-10-13 10:20:18,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:19,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:19,078 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:20:19,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:19,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:19,188 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:20:19,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:19,321 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:20:19,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19 WrapperNode [2024-10-13 10:20:19,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:19,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:20:19,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:20:19,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:20:19,334 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:20:19" (1/1) ... [2024-10-13 10:20:19,384 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:20:19" (1/1) ... [2024-10-13 10:20:19,460 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-10-13 10:20:19,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:20:19,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:20:19,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:20:19,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:20:19,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,611 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-10-13 10:20:19,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:20:19,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:20:19,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:20:19,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:20:19,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (1/1) ... [2024-10-13 10:20:19,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:19,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:20:19,743 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:20:19,745 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:20:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:20:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:20:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:20:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:20:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:20:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:20:19,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:20:19,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:20:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:20:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:20:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:20:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 10:20:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 10:20:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:20:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:20:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:20:19,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:20:19,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:20:20,049 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:20:20,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:20:28,075 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-13 10:20:28,076 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:20:28,123 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:20:28,123 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-13 10:20:28,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:20:28 BoogieIcfgContainer [2024-10-13 10:20:28,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:20:28,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:20:28,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:20:28,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:20:28,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:20:18" (1/3) ... [2024-10-13 10:20:28,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e09bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:20:28, skipping insertion in model container [2024-10-13 10:20:28,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:19" (2/3) ... [2024-10-13 10:20:28,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276e09bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:20:28, skipping insertion in model container [2024-10-13 10:20:28,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:20:28" (3/3) ... [2024-10-13 10:20:28,137 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-2.i [2024-10-13 10:20:28,161 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:20:28,161 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:20:28,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:20:28,213 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;@1ef84e2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:20:28,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:20:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 10:20:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:20:28,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:28,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:28,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 666562819, now seen corresponding path program 1 times [2024-10-13 10:20:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421650011] [2024-10-13 10:20:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:28,243 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:20:28,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:28,247 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:20:28,290 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:20:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:28,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:20:28,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:28,493 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:20:28,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:28,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:28,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421650011] [2024-10-13 10:20:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421650011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:28,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:20:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163113706] [2024-10-13 10:20:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:20:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:20:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:20:28,540 INFO L87 Difference]: Start difference. First operand has 262 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 252 states have internal predecessors, (392), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:28,631 INFO L93 Difference]: Finished difference Result 260 states and 356 transitions. [2024-10-13 10:20:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:20:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:20:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:28,648 INFO L225 Difference]: With dead ends: 260 [2024-10-13 10:20:28,649 INFO L226 Difference]: Without dead ends: 259 [2024-10-13 10:20:28,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:20:28,656 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:28,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:20:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-13 10:20:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-13 10:20:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 232 states have (on average 1.3491379310344827) internal successors, (313), 249 states have internal predecessors, (313), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:20:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2024-10-13 10:20:28,780 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 10 [2024-10-13 10:20:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2024-10-13 10:20:28,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2024-10-13 10:20:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:20:28,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:28,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:28,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:20:28,988 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:20:28,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash -757099125, now seen corresponding path program 1 times [2024-10-13 10:20:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:28,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641732599] [2024-10-13 10:20:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:28,990 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:20:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:28,993 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:20:28,995 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:20:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:29,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:20:29,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:29,236 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:29,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:29,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:20:29,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:20:29,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:20:29,337 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:20:29,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:29,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641732599] [2024-10-13 10:20:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641732599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:29,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:20:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546828227] [2024-10-13 10:20:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:20:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:20:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:20:29,343 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:20:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:30,040 INFO L93 Difference]: Finished difference Result 470 states and 634 transitions. [2024-10-13 10:20:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:20:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-13 10:20:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:30,044 INFO L225 Difference]: With dead ends: 470 [2024-10-13 10:20:30,044 INFO L226 Difference]: Without dead ends: 470 [2024-10-13 10:20:30,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:20:30,045 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 265 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:30,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 986 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:20:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-13 10:20:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 261. [2024-10-13 10:20:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 234 states have (on average 1.3461538461538463) internal successors, (315), 251 states have internal predecessors, (315), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:20:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 357 transitions. [2024-10-13 10:20:30,080 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 357 transitions. Word has length 12 [2024-10-13 10:20:30,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:30,081 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 357 transitions. [2024-10-13 10:20:30,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:20:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 357 transitions. [2024-10-13 10:20:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:20:30,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:30,083 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] [2024-10-13 10:20:30,090 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:20:30,287 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:20:30,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:30,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 409058189, now seen corresponding path program 1 times [2024-10-13 10:20:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305244044] [2024-10-13 10:20:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:30,290 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:20:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:30,293 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:20:30,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:20:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:30,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:20:30,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:30,710 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:20:30,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:30,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:30,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305244044] [2024-10-13 10:20:30,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305244044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:30,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:30,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:20:30,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179413515] [2024-10-13 10:20:30,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:30,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:20:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:30,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:20:30,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:20:30,713 INFO L87 Difference]: Start difference. First operand 261 states and 357 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:30,930 INFO L93 Difference]: Finished difference Result 264 states and 352 transitions. [2024-10-13 10:20:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:20:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:20:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:30,932 INFO L225 Difference]: With dead ends: 264 [2024-10-13 10:20:30,932 INFO L226 Difference]: Without dead ends: 264 [2024-10-13 10:20:30,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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:20:30,933 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 30 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:30,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 943 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:20:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-13 10:20:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-13 10:20:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3080168776371308) internal successors, (310), 254 states have internal predecessors, (310), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:20:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 352 transitions. [2024-10-13 10:20:30,945 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 352 transitions. Word has length 66 [2024-10-13 10:20:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:30,945 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 352 transitions. [2024-10-13 10:20:30,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 352 transitions. [2024-10-13 10:20:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:20:30,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:30,948 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] [2024-10-13 10:20:30,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:20:31,151 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:20:31,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash 387171585, now seen corresponding path program 1 times [2024-10-13 10:20:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:31,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328413717] [2024-10-13 10:20:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:31,158 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:20:31,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:31,160 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:20:31,162 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:20:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:31,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:20:31,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:31,694 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:20:31,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:31,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:31,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328413717] [2024-10-13 10:20:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328413717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:31,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:20:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783499583] [2024-10-13 10:20:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:31,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:20:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:31,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:20:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:20:31,700 INFO L87 Difference]: Start difference. First operand 264 states and 352 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:31,875 INFO L93 Difference]: Finished difference Result 258 states and 342 transitions. [2024-10-13 10:20:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:20:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:20:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:31,877 INFO L225 Difference]: With dead ends: 258 [2024-10-13 10:20:31,878 INFO L226 Difference]: Without dead ends: 258 [2024-10-13 10:20:31,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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:20:31,879 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:31,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 940 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:20:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-13 10:20:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-13 10:20:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 231 states have (on average 1.2987012987012987) internal successors, (300), 248 states have internal predecessors, (300), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 10:20:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2024-10-13 10:20:31,898 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 66 [2024-10-13 10:20:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:31,899 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2024-10-13 10:20:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2024-10-13 10:20:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 10:20:31,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:31,901 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] [2024-10-13 10:20:31,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:20:32,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:20:32,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:32,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 781538371, now seen corresponding path program 1 times [2024-10-13 10:20:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:32,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415880065] [2024-10-13 10:20:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:32,118 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:20:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:32,123 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:20:32,123 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:20:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:32,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:20:32,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:32,786 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:20:32,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:32,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415880065] [2024-10-13 10:20:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415880065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:32,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:32,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:20:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137315972] [2024-10-13 10:20:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:32,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:20:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:20:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:20:32,789 INFO L87 Difference]: Start difference. First operand 258 states and 342 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:33,432 INFO L93 Difference]: Finished difference Result 396 states and 512 transitions. [2024-10-13 10:20:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:20:33,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-13 10:20:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:33,436 INFO L225 Difference]: With dead ends: 396 [2024-10-13 10:20:33,437 INFO L226 Difference]: Without dead ends: 396 [2024-10-13 10:20:33,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:20:33,438 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 125 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:33,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 673 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:20:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-13 10:20:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 364. [2024-10-13 10:20:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 336 states have (on average 1.2708333333333333) internal successors, (427), 353 states have internal predecessors, (427), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 10:20:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2024-10-13 10:20:33,455 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 66 [2024-10-13 10:20:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:33,457 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2024-10-13 10:20:33,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2024-10-13 10:20:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-13 10:20:33,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:33,459 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] [2024-10-13 10:20:33,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:20:33,660 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:20:33,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:33,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -450143946, now seen corresponding path program 1 times [2024-10-13 10:20:33,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:33,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617204193] [2024-10-13 10:20:33,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:33,662 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:20:33,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:33,666 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:20:33,667 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:20:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:34,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:20:34,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:20:34,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:34,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:34,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617204193] [2024-10-13 10:20:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617204193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:34,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:20:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641376118] [2024-10-13 10:20:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:20:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:34,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:20:34,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:20:34,130 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:20:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:34,227 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2024-10-13 10:20:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:20:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2024-10-13 10:20:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:34,230 INFO L225 Difference]: With dead ends: 366 [2024-10-13 10:20:34,230 INFO L226 Difference]: Without dead ends: 366 [2024-10-13 10:20:34,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 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:20:34,231 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:34,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:20:34,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-13 10:20:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-13 10:20:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 337 states have (on average 1.2729970326409497) internal successors, (429), 355 states have internal predecessors, (429), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 474 transitions. [2024-10-13 10:20:34,240 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 474 transitions. Word has length 79 [2024-10-13 10:20:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:34,240 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 474 transitions. [2024-10-13 10:20:34,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:20:34,240 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2024-10-13 10:20:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:20:34,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:34,242 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] [2024-10-13 10:20:34,253 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:20:34,442 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:20:34,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 874798700, now seen corresponding path program 1 times [2024-10-13 10:20:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093590241] [2024-10-13 10:20:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:34,444 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:20:34,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:34,446 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:20:34,447 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:20:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:34,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:20:34,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:20:34,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:20:35,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:35,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093590241] [2024-10-13 10:20:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093590241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:35,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:20:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348809915] [2024-10-13 10:20:35,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:20:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:35,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:20:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:20:35,047 INFO L87 Difference]: Start difference. First operand 366 states and 474 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:35,241 INFO L93 Difference]: Finished difference Result 375 states and 488 transitions. [2024-10-13 10:20:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:20:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-10-13 10:20:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:35,244 INFO L225 Difference]: With dead ends: 375 [2024-10-13 10:20:35,244 INFO L226 Difference]: Without dead ends: 375 [2024-10-13 10:20:35,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 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:20:35,245 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 5 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:35,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 995 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:20:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-13 10:20:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 374. [2024-10-13 10:20:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 344 states have (on average 1.2848837209302326) internal successors, (442), 362 states have internal predecessors, (442), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 487 transitions. [2024-10-13 10:20:35,255 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 487 transitions. Word has length 81 [2024-10-13 10:20:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 487 transitions. [2024-10-13 10:20:35,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:35,256 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 487 transitions. [2024-10-13 10:20:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 10:20:35,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:35,257 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] [2024-10-13 10:20:35,268 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:20:35,457 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:20:35,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:35,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:35,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1775553962, now seen corresponding path program 2 times [2024-10-13 10:20:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036570827] [2024-10-13 10:20:35,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:20:35,460 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:20:35,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:35,461 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:20:35,461 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:20:36,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:20:36,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:20:36,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:20:36,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:20:36,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:20:36,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036570827] [2024-10-13 10:20:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036570827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:36,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-13 10:20:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303226643] [2024-10-13 10:20:36,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:36,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:20:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:20:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:20:36,736 INFO L87 Difference]: Start difference. First operand 374 states and 487 transitions. Second operand has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:20:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:37,038 INFO L93 Difference]: Finished difference Result 380 states and 497 transitions. [2024-10-13 10:20:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:20:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-10-13 10:20:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:37,043 INFO L225 Difference]: With dead ends: 380 [2024-10-13 10:20:37,043 INFO L226 Difference]: Without dead ends: 380 [2024-10-13 10:20:37,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:20:37,044 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 5 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:37,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1979 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:20:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-13 10:20:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-10-13 10:20:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 348 states have (on average 1.293103448275862) internal successors, (450), 366 states have internal predecessors, (450), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 495 transitions. [2024-10-13 10:20:37,057 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 495 transitions. Word has length 85 [2024-10-13 10:20:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 495 transitions. [2024-10-13 10:20:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.875) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:20:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 495 transitions. [2024-10-13 10:20:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 10:20:37,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:37,059 INFO L215 NwaCegarLoop]: trace histogram [10, 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] [2024-10-13 10:20:37,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:20:37,259 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:20:37,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 634020886, now seen corresponding path program 3 times [2024-10-13 10:20:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079390174] [2024-10-13 10:20:37,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:20:37,261 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:20:37,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:37,262 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:20:37,263 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:20:40,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-13 10:20:40,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:20:40,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:20:40,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:20:40,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 10:20:40,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079390174] [2024-10-13 10:20:40,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079390174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:40,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:40,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-10-13 10:20:40,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563041454] [2024-10-13 10:20:40,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:40,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:20:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:20:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:20:40,555 INFO L87 Difference]: Start difference. First operand 378 states and 495 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:20:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:41,499 INFO L93 Difference]: Finished difference Result 392 states and 518 transitions. [2024-10-13 10:20:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:20:41,500 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-10-13 10:20:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:41,502 INFO L225 Difference]: With dead ends: 392 [2024-10-13 10:20:41,502 INFO L226 Difference]: Without dead ends: 390 [2024-10-13 10:20:41,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=606, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:20:41,503 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 9 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:41,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3294 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:20:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-13 10:20:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2024-10-13 10:20:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 359 states have (on average 1.309192200557103) internal successors, (470), 377 states have internal predecessors, (470), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 515 transitions. [2024-10-13 10:20:41,521 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 515 transitions. Word has length 89 [2024-10-13 10:20:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:41,523 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 515 transitions. [2024-10-13 10:20:41,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:20:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 515 transitions. [2024-10-13 10:20:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 10:20:41,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:41,524 INFO L215 NwaCegarLoop]: trace histogram [18, 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] [2024-10-13 10:20:41,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:20:41,724 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:20:41,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:41,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1479288726, now seen corresponding path program 4 times [2024-10-13 10:20:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:41,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667109111] [2024-10-13 10:20:41,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 10:20:41,727 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:20:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:41,728 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:20:41,730 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:20:42,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 10:20:42,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:20:42,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:20:42,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:20:42,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:20:42,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667109111] [2024-10-13 10:20:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667109111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:42,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:42,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:20:42,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813922146] [2024-10-13 10:20:42,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:42,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:20:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:42,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:20:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:20:42,753 INFO L87 Difference]: Start difference. First operand 389 states and 515 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:43,289 INFO L93 Difference]: Finished difference Result 395 states and 522 transitions. [2024-10-13 10:20:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:20:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2024-10-13 10:20:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:43,292 INFO L225 Difference]: With dead ends: 395 [2024-10-13 10:20:43,292 INFO L226 Difference]: Without dead ends: 393 [2024-10-13 10:20:43,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 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:20:43,293 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 7 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:43,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2642 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:20:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-13 10:20:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 392. [2024-10-13 10:20:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 380 states have internal predecessors, (471), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 516 transitions. [2024-10-13 10:20:43,311 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 516 transitions. Word has length 97 [2024-10-13 10:20:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:43,312 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 516 transitions. [2024-10-13 10:20:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 516 transitions. [2024-10-13 10:20:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 10:20:43,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:43,314 INFO L215 NwaCegarLoop]: trace histogram [24, 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] [2024-10-13 10:20:43,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:20:43,514 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:20:43,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:43,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -392575498, now seen corresponding path program 5 times [2024-10-13 10:20:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475056300] [2024-10-13 10:20:43,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 10:20:43,516 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:20:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:43,517 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:20:43,518 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:20:44,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-10-13 10:20:44,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:20:44,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:20:44,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 167 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:20:44,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:20:45,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475056300] [2024-10-13 10:20:45,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475056300] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:45,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:45,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:20:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113649041] [2024-10-13 10:20:45,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:45,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:20:45,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:20:45,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:20:45,059 INFO L87 Difference]: Start difference. First operand 392 states and 516 transitions. Second operand has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:46,677 INFO L93 Difference]: Finished difference Result 407 states and 541 transitions. [2024-10-13 10:20:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:20:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-10-13 10:20:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:46,680 INFO L225 Difference]: With dead ends: 407 [2024-10-13 10:20:46,681 INFO L226 Difference]: Without dead ends: 405 [2024-10-13 10:20:46,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:20:46,682 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 13 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:46,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3966 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 10:20:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-13 10:20:46,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2024-10-13 10:20:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 374 states have (on average 1.2914438502673797) internal successors, (483), 392 states have internal predecessors, (483), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:20:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 528 transitions. [2024-10-13 10:20:46,692 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 528 transitions. Word has length 103 [2024-10-13 10:20:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:46,693 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 528 transitions. [2024-10-13 10:20:46,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.083333333333333) internal successors, (98), 26 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:20:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 528 transitions. [2024-10-13 10:20:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 10:20:46,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:46,694 INFO L215 NwaCegarLoop]: trace histogram [36, 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] [2024-10-13 10:20:46,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:20:46,895 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:20:46,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:46,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1178741430, now seen corresponding path program 6 times [2024-10-13 10:20:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532142338] [2024-10-13 10:20:46,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 10:20:46,897 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:20:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:46,898 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:20:46,899 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:20:51,396 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-10-13 10:20:51,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:20:51,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:20:51,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 347 proven. 253 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 10:20:52,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:20:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 599 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 10:20:54,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532142338] [2024-10-13 10:20:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532142338] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:20:54,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:20:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:20:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968561261] [2024-10-13 10:20:54,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:20:54,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:20:54,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:20:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:20:54,064 INFO L87 Difference]: Start difference. First operand 404 states and 528 transitions. Second operand has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:21:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:01,861 INFO L93 Difference]: Finished difference Result 440 states and 594 transitions. [2024-10-13 10:21:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-13 10:21:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2024-10-13 10:21:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:01,865 INFO L225 Difference]: With dead ends: 440 [2024-10-13 10:21:01,865 INFO L226 Difference]: Without dead ends: 437 [2024-10-13 10:21:01,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2784, Invalid=5958, Unknown=0, NotChecked=0, Total=8742 [2024-10-13 10:21:01,869 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 25 mSDsluCounter, 8577 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8910 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:01,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8910 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 10:21:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-13 10:21:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-13 10:21:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 407 states have (on average 1.28992628992629) internal successors, (525), 425 states have internal predecessors, (525), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:21:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 570 transitions. [2024-10-13 10:21:01,892 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 570 transitions. Word has length 115 [2024-10-13 10:21:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 570 transitions. [2024-10-13 10:21:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5416666666666665) internal successors, (122), 50 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:21:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 570 transitions. [2024-10-13 10:21:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 10:21:01,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:01,894 INFO L215 NwaCegarLoop]: trace histogram [58, 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] [2024-10-13 10:21:01,929 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:21:02,094 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:21:02,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:02,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -359030250, now seen corresponding path program 7 times [2024-10-13 10:21:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:02,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275144922] [2024-10-13 10:21:02,097 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 10:21:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:21:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:02,100 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:21:02,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:21:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:03,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:21:03,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:03,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 676 proven. 105 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:04,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:04,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275144922] [2024-10-13 10:21:04,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275144922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:04,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:04,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-10-13 10:21:04,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760805973] [2024-10-13 10:21:04,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:04,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:21:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:04,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:21:04,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 10:21:04,115 INFO L87 Difference]: Start difference. First operand 437 states and 570 transitions. Second operand has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:21:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:06,570 INFO L93 Difference]: Finished difference Result 446 states and 586 transitions. [2024-10-13 10:21:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-13 10:21:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 137 [2024-10-13 10:21:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:06,576 INFO L225 Difference]: With dead ends: 446 [2024-10-13 10:21:06,576 INFO L226 Difference]: Without dead ends: 446 [2024-10-13 10:21:06,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1292, Invalid=2614, Unknown=0, NotChecked=0, Total=3906 [2024-10-13 10:21:06,577 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 17 mSDsluCounter, 5267 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:06,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5599 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 10:21:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-13 10:21:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2024-10-13 10:21:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 414 states have (on average 1.3019323671497585) internal successors, (539), 432 states have internal predecessors, (539), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:21:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 584 transitions. [2024-10-13 10:21:06,592 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 584 transitions. Word has length 137 [2024-10-13 10:21:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:06,593 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 584 transitions. [2024-10-13 10:21:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.21875) internal successors, (103), 34 states have internal predecessors, (103), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:21:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 584 transitions. [2024-10-13 10:21:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 10:21:06,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:06,595 INFO L215 NwaCegarLoop]: trace histogram [74, 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] [2024-10-13 10:21:06,614 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:21:06,795 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:21:06,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1189456150, now seen corresponding path program 8 times [2024-10-13 10:21:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704909213] [2024-10-13 10:21:06,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:21:06,798 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:21:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:06,800 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:21:06,802 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:21:08,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:21:08,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:21:08,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:21:08,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:09,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 1396 proven. 465 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:12,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704909213] [2024-10-13 10:21:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704909213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:12,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:12,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2024-10-13 10:21:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098583986] [2024-10-13 10:21:12,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:12,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-13 10:21:12,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:12,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-13 10:21:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2024-10-13 10:21:12,203 INFO L87 Difference]: Start difference. First operand 444 states and 584 transitions. Second operand has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:21:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:24,051 INFO L93 Difference]: Finished difference Result 478 states and 650 transitions. [2024-10-13 10:21:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-13 10:21:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2024-10-13 10:21:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:24,054 INFO L225 Difference]: With dead ends: 478 [2024-10-13 10:21:24,054 INFO L226 Difference]: Without dead ends: 478 [2024-10-13 10:21:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2760 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=5148, Invalid=10854, Unknown=0, NotChecked=0, Total=16002 [2024-10-13 10:21:24,059 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 33 mSDsluCounter, 10201 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10533 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:24,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10533 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 10:21:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-13 10:21:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 476. [2024-10-13 10:21:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 446 states have (on average 1.352017937219731) internal successors, (603), 464 states have internal predecessors, (603), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-10-13 10:21:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 648 transitions. [2024-10-13 10:21:24,072 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 648 transitions. Word has length 153 [2024-10-13 10:21:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 648 transitions. [2024-10-13 10:21:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 2.109375) internal successors, (135), 66 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:21:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 648 transitions. [2024-10-13 10:21:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 10:21:24,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:24,075 INFO L215 NwaCegarLoop]: trace histogram [106, 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] [2024-10-13 10:21:24,097 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 10:21:24,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:21:24,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1119074070, now seen corresponding path program 9 times [2024-10-13 10:21:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569480907] [2024-10-13 10:21:24,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:21:24,278 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:21:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:24,280 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:21:24,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process