./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:59:21,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:59:22,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-16 23:59:22,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:59:22,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:59:22,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:59:22,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:59:22,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:59:22,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:59:22,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:59:22,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:59:22,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:59:22,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:59:22,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:59:22,099 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:59:22,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:59:22,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:59:22,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:59:22,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:59:22,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:59:22,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:59:22,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:59:22,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:59:22,104 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:59:22,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:59:22,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:59:22,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:59:22,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:59:22,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:59:22,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:59:22,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:59:22,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:59:22,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:59:22,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:59:22,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:59:22,108 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-16 23:59:22,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:59:22,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:59:22,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:59:22,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:59:22,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:59:22,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-16 23:59:23,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:59:24,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:59:24,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-16 23:59:24,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9227e4e2f/24ba7857ad714b5c82f6cb097ab682cb/FLAG7048ef24f [2024-11-16 23:59:24,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9227e4e2f/24ba7857ad714b5c82f6cb097ab682cb [2024-11-16 23:59:24,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:59:24,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:59:24,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:59:24,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:59:24,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:59:24,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:24" (1/1) ... [2024-11-16 23:59:24,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5408586d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:24, skipping insertion in model container [2024-11-16 23:59:24,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:24" (1/1) ... [2024-11-16 23:59:24,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:59:24,760 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,816 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,827 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,829 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,841 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,910 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,914 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,916 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,920 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,930 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,931 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,939 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,942 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:24,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:59:24,985 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-11-16 23:59:24,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@80f17a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:24, skipping insertion in model container [2024-11-16 23:59:24,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:59:24,987 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-16 23:59:24,992 INFO L158 Benchmark]: Toolchain (without parser) took 895.61ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 76.3MB in the beginning and 143.3MB in the end (delta: -67.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-16 23:59:24,992 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:59:24,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 892.57ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 76.0MB in the beginning and 143.3MB in the end (delta: -67.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-16 23:59:24,994 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.17ms. Allocated memory is still 148.9MB. Free memory is still 113.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 892.57ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 76.0MB in the beginning and 143.3MB in the end (delta: -67.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:59:27,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:59:28,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-16 23:59:28,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:59:28,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:59:28,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:59:28,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:59:28,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:59:28,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:59:28,077 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:59:28,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:59:28,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:59:28,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:59:28,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:59:28,078 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:59:28,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:59:28,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:59:28,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:59:28,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:59:28,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:59:28,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:59:28,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:59:28,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:59:28,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:59:28,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:59:28,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:59:28,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:59:28,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:59:28,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:59:28,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:59:28,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:59:28,088 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 23:59:28,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 23:59:28,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:59:28,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:59:28,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:59:28,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:59:28,089 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-16 23:59:28,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:59:28,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:59:28,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:59:28,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:59:28,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:59:28,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-16 23:59:29,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:59:30,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:59:30,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2024-11-16 23:59:30,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58378437b/ffd465aa64304553a9d89450cfa2c89a/FLAG94c8c09ce [2024-11-16 23:59:30,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58378437b/ffd465aa64304553a9d89450cfa2c89a [2024-11-16 23:59:30,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:59:30,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:59:30,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:59:30,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:59:30,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:59:30,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e57f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30, skipping insertion in model container [2024-11-16 23:59:30,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:59:30,449 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,500 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,530 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,530 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,532 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,533 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,534 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,537 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,540 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:59:30,553 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-16 23:59:30,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:59:30,581 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,604 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,609 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,611 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,617 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,629 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,629 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,630 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,630 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,632 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,632 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,633 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,633 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,635 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:59:30,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:59:30,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:59:30,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:59:30,747 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:59:30,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30 WrapperNode [2024-11-16 23:59:30,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:59:30,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:59:30,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:59:30,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:59:30,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,846 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 996 [2024-11-16 23:59:30,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:59:30,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:59:30,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:59:30,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:59:30,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,926 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-16 23:59:30,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:30,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:31,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:59:31,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:59:31,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:59:31,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:59:31,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (1/1) ... [2024-11-16 23:59:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:59:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:59:31,042 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-11-16 23:59:31,052 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-11-16 23:59:31,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 23:59:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 23:59:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 23:59:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 23:59:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 23:59:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 23:59:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 23:59:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 23:59:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 23:59:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 23:59:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 23:59:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 23:59:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 23:59:31,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:59:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:59:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:59:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 23:59:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 23:59:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 23:59:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 23:59:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:59:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 23:59:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 23:59:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 23:59:31,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:59:31,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:59:31,253 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:59:31,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:59:38,353 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 23:59:38,437 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-16 23:59:38,438 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:59:38,452 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:59:38,452 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:59:38,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:38 BoogieIcfgContainer [2024-11-16 23:59:38,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:59:38,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:59:38,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:59:38,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:59:38,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:59:30" (1/3) ... [2024-11-16 23:59:38,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc9db29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:38, skipping insertion in model container [2024-11-16 23:59:38,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:59:30" (2/3) ... [2024-11-16 23:59:38,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc9db29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:59:38, skipping insertion in model container [2024-11-16 23:59:38,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:59:38" (3/3) ... [2024-11-16 23:59:38,459 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2024-11-16 23:59:38,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:59:38,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:59:38,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:59:38,547 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;@5d83e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:59:38,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:59:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 198 states have (on average 1.6414141414141414) internal successors, (325), 201 states have internal predecessors, (325), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 23:59:38,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-16 23:59:38,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:38,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-16 23:59:38,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:38,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 358774453, now seen corresponding path program 1 times [2024-11-16 23:59:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:38,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436530941] [2024-11-16 23:59:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:38,570 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-11-16 23:59:38,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:38,576 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-11-16 23:59:38,593 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-11-16 23:59:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:38,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 23:59:38,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:38,806 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-16 23:59:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:38,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:38,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436530941] [2024-11-16 23:59:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436530941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:59:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575431632] [2024-11-16 23:59:38,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:38,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:59:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:59:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-16 23:59:38,842 INFO L87 Difference]: Start difference. First operand has 208 states, 198 states have (on average 1.6414141414141414) internal successors, (325), 201 states have internal predecessors, (325), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-11-16 23:59:43,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 23:59:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:43,939 INFO L93 Difference]: Finished difference Result 306 states and 397 transitions. [2024-11-16 23:59:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:59:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-16 23:59:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:43,967 INFO L225 Difference]: With dead ends: 306 [2024-11-16 23:59:43,967 INFO L226 Difference]: Without dead ends: 301 [2024-11-16 23:59:43,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-16 23:59:43,970 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 123 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:43,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 499 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 398 Unchecked, 5.0s Time] [2024-11-16 23:59:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-16 23:59:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 204. [2024-11-16 23:59:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 195 states have (on average 1.2871794871794873) internal successors, (251), 197 states have internal predecessors, (251), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 23:59:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2024-11-16 23:59:44,022 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 261 transitions. Word has length 5 [2024-11-16 23:59:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:44,023 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 261 transitions. [2024-11-16 23:59:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-11-16 23:59:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 261 transitions. [2024-11-16 23:59:44,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 23:59:44,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:44,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:44,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 23:59:44,225 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-11-16 23:59:44,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:44,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -528994665, now seen corresponding path program 1 times [2024-11-16 23:59:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977975390] [2024-11-16 23:59:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:44,229 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-11-16 23:59:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:44,230 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-11-16 23:59:44,250 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-11-16 23:59:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:44,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 23:59:44,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:44,664 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19|)))) is different from true [2024-11-16 23:59:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:44,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:44,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977975390] [2024-11-16 23:59:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977975390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:44,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:44,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:59:44,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017254369] [2024-11-16 23:59:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:59:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:59:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-16 23:59:44,679 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-16 23:59:48,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 23:59:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:49,362 INFO L93 Difference]: Finished difference Result 303 states and 392 transitions. [2024-11-16 23:59:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:59:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-16 23:59:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:49,371 INFO L225 Difference]: With dead ends: 303 [2024-11-16 23:59:49,372 INFO L226 Difference]: Without dead ends: 300 [2024-11-16 23:59:49,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-16 23:59:49,375 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 114 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:49,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 496 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 391 Unchecked, 4.7s Time] [2024-11-16 23:59:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-16 23:59:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 276. [2024-11-16 23:59:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 265 states have (on average 1.2943396226415094) internal successors, (343), 267 states have internal predecessors, (343), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 23:59:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 357 transitions. [2024-11-16 23:59:49,411 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 357 transitions. Word has length 14 [2024-11-16 23:59:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:49,411 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 357 transitions. [2024-11-16 23:59:49,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-11-16 23:59:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 357 transitions. [2024-11-16 23:59:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 23:59:49,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:49,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:49,426 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-11-16 23:59:49,612 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-11-16 23:59:49,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1176934235, now seen corresponding path program 1 times [2024-11-16 23:59:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065054720] [2024-11-16 23:59:49,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:49,614 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-11-16 23:59:49,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:49,617 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-11-16 23:59:49,618 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-11-16 23:59:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:49,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:59:49,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:49,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:49,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065054720] [2024-11-16 23:59:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065054720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:59:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504291277] [2024-11-16 23:59:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:59:49,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:49,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:59:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:59:49,971 INFO L87 Difference]: Start difference. First operand 276 states and 357 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-16 23:59:54,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 23:59:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:56,039 INFO L93 Difference]: Finished difference Result 368 states and 475 transitions. [2024-11-16 23:59:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:59:56,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2024-11-16 23:59:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:56,043 INFO L225 Difference]: With dead ends: 368 [2024-11-16 23:59:56,043 INFO L226 Difference]: Without dead ends: 365 [2024-11-16 23:59:56,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-11-16 23:59:56,045 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 138 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:56,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 702 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-16 23:59:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-16 23:59:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 364. [2024-11-16 23:59:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.2946175637393769) internal successors, (457), 356 states have internal predecessors, (457), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 23:59:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2024-11-16 23:59:56,071 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 16 [2024-11-16 23:59:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2024-11-16 23:59:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-11-16 23:59:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2024-11-16 23:59:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 23:59:56,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:56,078 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] [2024-11-16 23:59:56,082 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-11-16 23:59:56,279 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-11-16 23:59:56,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:56,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -524560299, now seen corresponding path program 1 times [2024-11-16 23:59:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545248246] [2024-11-16 23:59:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:56,280 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-11-16 23:59:56,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:56,285 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-11-16 23:59:56,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 (5)] Waiting until timeout for monitored process [2024-11-16 23:59:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:56,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:59:56,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:56,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:56,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545248246] [2024-11-16 23:59:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545248246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:59:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362779514] [2024-11-16 23:59:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:56,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:59:56,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:56,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:59:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:59:56,655 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-11-16 23:59:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:56,881 INFO L93 Difference]: Finished difference Result 373 states and 456 transitions. [2024-11-16 23:59:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:59:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 52 [2024-11-16 23:59:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:56,883 INFO L225 Difference]: With dead ends: 373 [2024-11-16 23:59:56,883 INFO L226 Difference]: Without dead ends: 373 [2024-11-16 23:59:56,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-11-16 23:59:56,884 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 30 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:56,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 673 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 23:59:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-16 23:59:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-16 23:59:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 362 states have (on average 1.2209944751381216) internal successors, (442), 365 states have internal predecessors, (442), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 23:59:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 456 transitions. [2024-11-16 23:59:56,912 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 456 transitions. Word has length 52 [2024-11-16 23:59:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:56,912 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 456 transitions. [2024-11-16 23:59:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-11-16 23:59:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 456 transitions. [2024-11-16 23:59:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 23:59:56,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:56,914 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] [2024-11-16 23:59:56,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 23:59:57,124 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-11-16 23:59:57,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:57,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1861531502, now seen corresponding path program 1 times [2024-11-16 23:59:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580465037] [2024-11-16 23:59:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:57,126 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-11-16 23:59:57,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:57,128 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-11-16 23:59:57,130 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-11-16 23:59:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:57,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 23:59:57,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:57,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:57,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580465037] [2024-11-16 23:59:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580465037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:57,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:59:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339593532] [2024-11-16 23:59:57,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:59:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:59:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:59:57,436 INFO L87 Difference]: Start difference. First operand 373 states and 456 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-16 23:59:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:57,514 INFO L93 Difference]: Finished difference Result 355 states and 426 transitions. [2024-11-16 23:59:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:59:57,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2024-11-16 23:59:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:57,515 INFO L225 Difference]: With dead ends: 355 [2024-11-16 23:59:57,517 INFO L226 Difference]: Without dead ends: 355 [2024-11-16 23:59:57,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-11-16 23:59:57,518 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:57,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:59:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-16 23:59:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-11-16 23:59:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 344 states have (on average 1.197674418604651) internal successors, (412), 347 states have internal predecessors, (412), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 23:59:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 426 transitions. [2024-11-16 23:59:57,530 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 426 transitions. Word has length 52 [2024-11-16 23:59:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:57,531 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 426 transitions. [2024-11-16 23:59:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-16 23:59:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 426 transitions. [2024-11-16 23:59:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 23:59:57,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:57,532 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] [2024-11-16 23:59:57,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 23:59:57,735 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-11-16 23:59:57,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:57,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1436363441, now seen corresponding path program 1 times [2024-11-16 23:59:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777560207] [2024-11-16 23:59:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:57,737 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-11-16 23:59:57,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:57,739 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-11-16 23:59:57,740 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-11-16 23:59:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:57,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 23:59:57,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:57,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:59:57,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:59:57,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:59:58,006 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-11-16 23:59:58,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:59:58,152 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-11-16 23:59:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:59:58,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:58,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:58,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777560207] [2024-11-16 23:59:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777560207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:59:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674368453] [2024-11-16 23:59:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:58,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:59:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:59:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:59:58,235 INFO L87 Difference]: Start difference. First operand 355 states and 426 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-16 23:59:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:58,770 INFO L93 Difference]: Finished difference Result 362 states and 443 transitions. [2024-11-16 23:59:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:59:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2024-11-16 23:59:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:58,772 INFO L225 Difference]: With dead ends: 362 [2024-11-16 23:59:58,772 INFO L226 Difference]: Without dead ends: 359 [2024-11-16 23:59:58,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:59:58,773 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 110 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:58,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 930 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 23:59:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-16 23:59:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 311. [2024-11-16 23:59:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 301 states have (on average 1.2192691029900333) internal successors, (367), 304 states have internal predecessors, (367), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 23:59:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 379 transitions. [2024-11-16 23:59:58,780 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 379 transitions. Word has length 52 [2024-11-16 23:59:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 379 transitions. [2024-11-16 23:59:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-11-16 23:59:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 379 transitions. [2024-11-16 23:59:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-16 23:59:58,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:58,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:58,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-16 23:59:58,985 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-11-16 23:59:58,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:59,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 223987368, now seen corresponding path program 1 times [2024-11-16 23:59:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:59,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606942710] [2024-11-16 23:59:59,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:59,032 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-11-16 23:59:59,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:59,035 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-11-16 23:59:59,038 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-11-16 23:59:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:59,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:59:59,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:59:59,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:59:59,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:59,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606942710] [2024-11-16 23:59:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606942710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:59:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:59:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:59:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343967888] [2024-11-16 23:59:59,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:59:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:59:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:59:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:59:59,763 INFO L87 Difference]: Start difference. First operand 311 states and 379 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:59:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:59,921 INFO L93 Difference]: Finished difference Result 317 states and 369 transitions. [2024-11-16 23:59:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:59:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-16 23:59:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:59,923 INFO L225 Difference]: With dead ends: 317 [2024-11-16 23:59:59,923 INFO L226 Difference]: Without dead ends: 317 [2024-11-16 23:59:59,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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-11-16 23:59:59,924 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 33 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:59,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 625 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:59:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-16 23:59:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-11-16 23:59:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 307 states have (on average 1.1628664495114007) internal successors, (357), 310 states have internal predecessors, (357), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 23:59:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 369 transitions. [2024-11-16 23:59:59,937 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 369 transitions. Word has length 86 [2024-11-16 23:59:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 369 transitions. [2024-11-16 23:59:59,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:59:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 369 transitions. [2024-11-16 23:59:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-16 23:59:59,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:59,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:59,963 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-11-17 00:00:00,144 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-11-17 00:00:00,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 922226609, now seen corresponding path program 1 times [2024-11-17 00:00:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595622195] [2024-11-17 00:00:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:00:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:00:00,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:00,155 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-11-17 00:00:00,158 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-11-17 00:00:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:00:00,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:00:00,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:00:00,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:00:00,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595622195] [2024-11-17 00:00:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595622195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:00:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:00:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:00:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455405177] [2024-11-17 00:00:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:00:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:00:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:00,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:00:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:00:00,554 INFO L87 Difference]: Start difference. First operand 317 states and 369 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:00,608 INFO L93 Difference]: Finished difference Result 305 states and 349 transitions. [2024-11-17 00:00:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:00:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-17 00:00:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:00,610 INFO L225 Difference]: With dead ends: 305 [2024-11-17 00:00:00,610 INFO L226 Difference]: Without dead ends: 305 [2024-11-17 00:00:00,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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-11-17 00:00:00,611 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 8 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:00,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 625 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:00:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-17 00:00:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-17 00:00:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 295 states have (on average 1.1423728813559322) internal successors, (337), 298 states have internal predecessors, (337), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:00:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 349 transitions. [2024-11-17 00:00:00,615 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 349 transitions. Word has length 86 [2024-11-17 00:00:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:00,616 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 349 transitions. [2024-11-17 00:00:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 349 transitions. [2024-11-17 00:00:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-17 00:00:00,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:00,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:00,625 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-11-17 00:00:00,821 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-11-17 00:00:00,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:00,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:00,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1523908590, now seen corresponding path program 1 times [2024-11-17 00:00:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306734876] [2024-11-17 00:00:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:00:00,828 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-11-17 00:00:00,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:00,833 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-11-17 00:00:00,838 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-11-17 00:00:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:00:01,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:00:01,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:00:01,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:00:01,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306734876] [2024-11-17 00:00:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306734876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:00:01,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:00:01,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:00:01,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256743377] [2024-11-17 00:00:01,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:00:01,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:00:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:00:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:00:01,444 INFO L87 Difference]: Start difference. First operand 305 states and 349 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:00:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:01,479 INFO L93 Difference]: Finished difference Result 308 states and 353 transitions. [2024-11-17 00:00:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:00:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-17 00:00:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:01,484 INFO L225 Difference]: With dead ends: 308 [2024-11-17 00:00:01,484 INFO L226 Difference]: Without dead ends: 308 [2024-11-17 00:00:01,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 83 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-11-17 00:00:01,484 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:01,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 680 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:00:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-17 00:00:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-17 00:00:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 297 states have (on average 1.1447811447811447) internal successors, (340), 301 states have internal predecessors, (340), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:00:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 353 transitions. [2024-11-17 00:00:01,508 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 353 transitions. Word has length 86 [2024-11-17 00:00:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:01,508 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 353 transitions. [2024-11-17 00:00:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:00:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 353 transitions. [2024-11-17 00:00:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:00:01,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:01,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:01,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:00:01,714 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-11-17 00:00:01,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash 649871602, now seen corresponding path program 1 times [2024-11-17 00:00:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304709701] [2024-11-17 00:00:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:00:01,724 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-11-17 00:00:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:01,727 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-11-17 00:00:01,728 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-11-17 00:00:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:00:02,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:00:02,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:00:02,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:00:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:00:02,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304709701] [2024-11-17 00:00:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304709701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:00:02,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:00:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:00:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215866545] [2024-11-17 00:00:02,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:00:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:00:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:00:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:00:02,854 INFO L87 Difference]: Start difference. First operand 308 states and 353 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:03,141 INFO L93 Difference]: Finished difference Result 319 states and 369 transitions. [2024-11-17 00:00:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:00:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-17 00:00:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:03,145 INFO L225 Difference]: With dead ends: 319 [2024-11-17 00:00:03,148 INFO L226 Difference]: Without dead ends: 319 [2024-11-17 00:00:03,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:00:03,149 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:03,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1352 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:00:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-17 00:00:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-11-17 00:00:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 305 states have (on average 1.160655737704918) internal successors, (354), 309 states have internal predecessors, (354), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:00:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 367 transitions. [2024-11-17 00:00:03,168 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 367 transitions. Word has length 88 [2024-11-17 00:00:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 367 transitions. [2024-11-17 00:00:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 367 transitions. [2024-11-17 00:00:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-17 00:00:03,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:03,174 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:03,196 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-11-17 00:00:03,374 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-11-17 00:00:03,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:03,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1450383954, now seen corresponding path program 2 times [2024-11-17 00:00:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548160823] [2024-11-17 00:00:03,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:00:03,377 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-11-17 00:00:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:03,380 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-11-17 00:00:03,383 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-11-17 00:00:03,987 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:00:03,988 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:00:04,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:00:04,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:00:04,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:00:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:00:04,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548160823] [2024-11-17 00:00:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548160823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:00:04,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:00:04,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:00:04,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314715178] [2024-11-17 00:00:04,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:00:04,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:00:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:04,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:00:04,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:00:04,316 INFO L87 Difference]: Start difference. First operand 317 states and 367 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:05,190 INFO L93 Difference]: Finished difference Result 332 states and 389 transitions. [2024-11-17 00:00:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:00:05,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2024-11-17 00:00:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:05,193 INFO L225 Difference]: With dead ends: 332 [2024-11-17 00:00:05,193 INFO L226 Difference]: Without dead ends: 328 [2024-11-17 00:00:05,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:00:05,194 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 8 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:05,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1362 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:00:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-17 00:00:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-17 00:00:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 314 states have (on average 1.1656050955414012) internal successors, (366), 318 states have internal predecessors, (366), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:00:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 379 transitions. [2024-11-17 00:00:05,219 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 379 transitions. Word has length 92 [2024-11-17 00:00:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:05,220 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 379 transitions. [2024-11-17 00:00:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 379 transitions. [2024-11-17 00:00:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-17 00:00:05,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:05,226 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:05,250 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-11-17 00:00:05,427 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-11-17 00:00:05,427 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1508889280, now seen corresponding path program 3 times [2024-11-17 00:00:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831186630] [2024-11-17 00:00:05,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:00:05,429 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-11-17 00:00:05,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:05,430 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-11-17 00:00:05,432 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-11-17 00:00:05,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:00:05,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:00:05,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:00:05,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-17 00:00:06,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:00:06,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831186630] [2024-11-17 00:00:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831186630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:00:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:00:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:00:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61572906] [2024-11-17 00:00:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:00:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:00:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:00:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:00:06,308 INFO L87 Difference]: Start difference. First operand 326 states and 379 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:10,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:00:14,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:00:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:16,725 INFO L93 Difference]: Finished difference Result 415 states and 485 transitions. [2024-11-17 00:00:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:00:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-11-17 00:00:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:16,732 INFO L225 Difference]: With dead ends: 415 [2024-11-17 00:00:16,732 INFO L226 Difference]: Without dead ends: 415 [2024-11-17 00:00:16,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-11-17 00:00:16,733 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 419 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:16,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 395 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-17 00:00:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-17 00:00:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2024-11-17 00:00:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 399 states have (on average 1.167919799498747) internal successors, (466), 404 states have internal predecessors, (466), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:00:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 481 transitions. [2024-11-17 00:00:16,755 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 481 transitions. Word has length 101 [2024-11-17 00:00:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 481 transitions. [2024-11-17 00:00:16,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 481 transitions. [2024-11-17 00:00:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:00:16,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:16,760 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:16,785 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 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:00:16,961 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-11-17 00:00:16,961 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1275550066, now seen corresponding path program 1 times [2024-11-17 00:00:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:16,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679570575] [2024-11-17 00:00:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:00:16,963 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-11-17 00:00:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:16,964 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-11-17 00:00:16,966 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-11-17 00:00:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:00:17,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:00:17,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:00:17,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:00:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:00:20,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679570575] [2024-11-17 00:00:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679570575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:00:20,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:00:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:00:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428527553] [2024-11-17 00:00:20,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:00:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:00:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:20,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:00:20,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:00:20,013 INFO L87 Difference]: Start difference. First operand 412 states and 481 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:23,339 INFO L93 Difference]: Finished difference Result 436 states and 521 transitions. [2024-11-17 00:00:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:00:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-11-17 00:00:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:23,345 INFO L225 Difference]: With dead ends: 436 [2024-11-17 00:00:23,345 INFO L226 Difference]: Without dead ends: 432 [2024-11-17 00:00:23,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:00:23,346 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 13 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:23,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2718 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 00:00:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-17 00:00:23,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2024-11-17 00:00:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 417 states have (on average 1.1750599520383693) internal successors, (490), 422 states have internal predecessors, (490), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:00:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 505 transitions. [2024-11-17 00:00:23,366 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 505 transitions. Word has length 103 [2024-11-17 00:00:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:23,366 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 505 transitions. [2024-11-17 00:00:23,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 505 transitions. [2024-11-17 00:00:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-17 00:00:23,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:23,373 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:23,406 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-11-17 00:00:23,573 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-11-17 00:00:23,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:23,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1273828018, now seen corresponding path program 2 times [2024-11-17 00:00:23,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:23,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840096173] [2024-11-17 00:00:23,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:00:23,576 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-11-17 00:00:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:23,579 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-11-17 00:00:23,580 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-11-17 00:00:24,572 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:00:24,572 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:00:24,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:00:24,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 00:00:25,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:00:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-17 00:00:28,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840096173] [2024-11-17 00:00:28,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840096173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:00:28,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:00:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:00:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745016978] [2024-11-17 00:00:28,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:00:28,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:00:28,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:00:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:00:28,569 INFO L87 Difference]: Start difference. First operand 430 states and 505 transitions. Second operand has 50 states, 50 states have (on average 2.7) internal successors, (135), 50 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:36,521 INFO L93 Difference]: Finished difference Result 470 states and 577 transitions. [2024-11-17 00:00:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:00:36,524 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.7) internal successors, (135), 50 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2024-11-17 00:00:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:36,526 INFO L225 Difference]: With dead ends: 470 [2024-11-17 00:00:36,526 INFO L226 Difference]: Without dead ends: 466 [2024-11-17 00:00:36,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:00:36,528 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 26 mSDsluCounter, 5202 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5430 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:36,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5430 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-17 00:00:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-17 00:00:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2024-11-17 00:00:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 451 states have (on average 1.188470066518847) internal successors, (536), 456 states have internal predecessors, (536), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:00:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 551 transitions. [2024-11-17 00:00:36,535 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 551 transitions. Word has length 121 [2024-11-17 00:00:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:36,535 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 551 transitions. [2024-11-17 00:00:36,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.7) internal successors, (135), 50 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:00:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 551 transitions. [2024-11-17 00:00:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-17 00:00:36,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:36,537 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:00:36,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 00:00:36,737 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-11-17 00:00:36,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:36,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 802630798, now seen corresponding path program 3 times [2024-11-17 00:00:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084878247] [2024-11-17 00:00:36,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:00:36,739 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-11-17 00:00:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:36,741 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-11-17 00:00:36,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:00:37,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:00:37,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:00:37,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:00:37,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:37,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:00:37,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:00:37,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:00:37,848 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-11-17 00:00:37,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:00:37,953 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-11-17 00:00:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-17 00:00:37,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:00:37,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084878247] [2024-11-17 00:00:37,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084878247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:00:37,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:00:37,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:00:37,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789785666] [2024-11-17 00:00:37,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:00:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:00:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:38,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:00:38,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:00:38,000 INFO L87 Difference]: Start difference. First operand 464 states and 551 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:38,309 INFO L93 Difference]: Finished difference Result 570 states and 677 transitions. [2024-11-17 00:00:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:00:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2024-11-17 00:00:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:38,311 INFO L225 Difference]: With dead ends: 570 [2024-11-17 00:00:38,311 INFO L226 Difference]: Without dead ends: 570 [2024-11-17 00:00:38,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:00:38,312 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 467 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:38,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 621 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:00:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-17 00:00:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 466. [2024-11-17 00:00:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 453 states have (on average 1.1876379690949228) internal successors, (538), 458 states have internal predecessors, (538), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:00:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 553 transitions. [2024-11-17 00:00:38,320 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 553 transitions. Word has length 155 [2024-11-17 00:00:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:38,320 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 553 transitions. [2024-11-17 00:00:38,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:00:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 553 transitions. [2024-11-17 00:00:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-17 00:00:38,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:38,322 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:00:38,332 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 (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:00:38,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-11-17 00:00:38,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1733046505, now seen corresponding path program 1 times [2024-11-17 00:00:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554419095] [2024-11-17 00:00:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:00:38,532 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-11-17 00:00:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:38,534 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11-17 00:00:38,536 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 (17)] Waiting until timeout for monitored process [2024-11-17 00:00:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:00:39,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:00:39,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:00:40,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:00:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:00:41,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:00:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554419095] [2024-11-17 00:00:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554419095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:00:41,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:00:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:00:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415473153] [2024-11-17 00:00:41,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:00:41,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:00:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:00:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:00:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:00:41,970 INFO L87 Difference]: Start difference. First operand 466 states and 553 transitions. Second operand has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:00:49,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:00:49,148 INFO L93 Difference]: Finished difference Result 495 states and 607 transitions. [2024-11-17 00:00:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:00:49,149 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 200 [2024-11-17 00:00:49,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:00:49,151 INFO L225 Difference]: With dead ends: 495 [2024-11-17 00:00:49,151 INFO L226 Difference]: Without dead ends: 495 [2024-11-17 00:00:49,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:00:49,155 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 26 mSDsluCounter, 7643 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7870 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:00:49,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7870 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 00:00:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-17 00:00:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 491. [2024-11-17 00:00:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 478 states have (on average 1.2301255230125523) internal successors, (588), 483 states have internal predecessors, (588), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-17 00:00:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 603 transitions. [2024-11-17 00:00:49,163 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 603 transitions. Word has length 200 [2024-11-17 00:00:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:00:49,163 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 603 transitions. [2024-11-17 00:00:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:00:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 603 transitions. [2024-11-17 00:00:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-17 00:00:49,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:00:49,165 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-17 00:00:49,184 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 (17)] Ended with exit code 0 [2024-11-17 00:00:49,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11-17 00:00:49,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:00:49,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:00:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 452367227, now seen corresponding path program 2 times [2024-11-17 00:00:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:00:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936591765] [2024-11-17 00:00:49,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:00:49,368 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-11-17 00:00:49,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:00:49,372 INFO L229 MonitoredProcess]: Starting monitored process 18 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-11-17 00:00:49,373 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 (18)] Waiting until timeout for monitored process [2024-11-17 00:00:51,527 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:00:51,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:00:51,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 00:00:51,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:00:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:00:53,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:01:00,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936591765] [2024-11-17 00:01:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936591765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:00,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-17 00:01:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762661900] [2024-11-17 00:01:00,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:00,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-17 00:01:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:00,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-17 00:01:00,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-17 00:01:00,503 INFO L87 Difference]: Start difference. First operand 491 states and 603 transitions. Second operand has 102 states, 102 states have (on average 2.235294117647059) internal successors, (228), 102 states have internal predecessors, (228), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)