./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc 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_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:15:23,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:15:23,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:15:23,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:15:23,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:15:23,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:15:23,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:15:23,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:15:23,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:15:23,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:15:23,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:15:23,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:15:23,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:15:23,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:15:23,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:15:23,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:15:23,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:15:23,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:15:23,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:15:23,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:15:23,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:15:23,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:15:23,244 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:15:23,245 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:15:23,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:15:23,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:15:23,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:15:23,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:15:23,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:15:23,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:15:23,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:15:23,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:15:23,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:15:23,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:15:23,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:15:23,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:15:23,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:23,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:15:23,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:15:23,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:15:23,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:15:23,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:15:23,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:15:23,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:15:23,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:15:23,254 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 -> efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 [2024-11-19 06:15:23,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:15:23,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:15:23,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:15:23,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:15:23,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:15:23,474 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_test4-3.i [2024-11-19 06:15:24,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:15:25,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:15:25,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2024-11-19 06:15:25,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fbee472/7402ca3fbb844615a199f42f45e10d7b/FLAGa914826a9 [2024-11-19 06:15:25,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fbee472/7402ca3fbb844615a199f42f45e10d7b [2024-11-19 06:15:25,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:15:25,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:15:25,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:25,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:15:25,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:15:25,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:25" (1/1) ... [2024-11-19 06:15:25,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64923268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:25, skipping insertion in model container [2024-11-19 06:15:25,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:25" (1/1) ... [2024-11-19 06:15:25,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:25,721 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,759 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,770 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,773 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,778 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,816 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,821 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,827 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,847 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,849 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,851 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,853 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,858 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,858 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,861 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,868 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,869 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,871 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:25,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:25,894 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-19 06:15:25,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7fa6614c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:25, skipping insertion in model container [2024-11-19 06:15:25,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:25,896 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:15:25,897 INFO L158 Benchmark]: Toolchain (without parser) took 561.38ms. Allocated memory is still 163.6MB. Free memory was 136.1MB in the beginning and 110.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 06:15:25,898 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:15:25,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.59ms. Allocated memory is still 163.6MB. Free memory was 136.1MB in the beginning and 110.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 06:15:25,899 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.23ms. Allocated memory is still 130.0MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.59ms. Allocated memory is still 163.6MB. Free memory was 136.1MB in the beginning and 110.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 769]: 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_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:15:27,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:15:27,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:15:27,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:15:27,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:15:27,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:15:27,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:15:27,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:15:27,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:15:27,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:15:27,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:15:27,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:15:27,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:15:27,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:15:27,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:15:27,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:15:27,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:15:27,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:15:27,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:15:27,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:15:27,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:15:27,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:15:27,779 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:15:27,779 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:15:27,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:15:27,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:15:27,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:15:27,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:15:27,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:15:27,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:15:27,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:15:27,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:15:27,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:15:27,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:15:27,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:15:27,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:15:27,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:15:27,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:15:27,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:27,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:15:27,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:15:27,785 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:15:27,785 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:15:27,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:15:27,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:15:27,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:15:27,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:15:27,787 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 -> efaea2320311f06fbd3071893d75fb70222c33e449b43348105f12b548a90ab4 [2024-11-19 06:15:28,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:15:28,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:15:28,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:15:28,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:15:28,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:15:28,094 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_test4-3.i [2024-11-19 06:15:29,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:15:29,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:15:29,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-3.i [2024-11-19 06:15:29,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c3df7ab/80374b42261341f0b61b4468ecd75ad5/FLAGa11a77264 [2024-11-19 06:15:30,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c3df7ab/80374b42261341f0b61b4468ecd75ad5 [2024-11-19 06:15:30,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:15:30,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:15:30,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:30,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:15:30,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:15:30,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:30,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c9c4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30, skipping insertion in model container [2024-11-19 06:15:30,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:30,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:30,547 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,584 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,589 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,611 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,625 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,626 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,626 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,630 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,630 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,631 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,631 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:30,652 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:15:30,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:30,690 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,701 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,705 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,736 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,738 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,739 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,742 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,748 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,749 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,753 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,754 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,760 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,760 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,761 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,761 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:30,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:30,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:15:30,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:30,882 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:15:30,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30 WrapperNode [2024-11-19 06:15:30,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:30,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:15:30,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:15:30,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:15:30,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:30,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,003 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1471 [2024-11-19 06:15:31,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:15:31,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:15:31,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:15:31,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:15:31,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,115 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-19 06:15:31,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:15:31,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:15:31,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:15:31,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:15:31,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (1/1) ... [2024-11-19 06:15:31,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:31,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:15:31,227 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-19 06:15:31,229 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-19 06:15:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:15:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:15:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:15:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:15:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:15:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:15:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:15:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:15:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:15:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:15:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:15:31,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:15:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:15:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:15:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:15:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:15:31,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:15:31,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:15:31,486 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:15:31,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:15:46,886 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-11-19 06:15:46,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:15:46,913 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:15:46,913 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-19 06:15:46,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:15:46 BoogieIcfgContainer [2024-11-19 06:15:46,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:15:46,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:15:46,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:15:46,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:15:46,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:15:30" (1/3) ... [2024-11-19 06:15:46,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30528927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:15:46, skipping insertion in model container [2024-11-19 06:15:46,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:30" (2/3) ... [2024-11-19 06:15:46,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30528927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:15:46, skipping insertion in model container [2024-11-19 06:15:46,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:15:46" (3/3) ... [2024-11-19 06:15:46,925 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-3.i [2024-11-19 06:15:46,938 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:15:46,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:15:46,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:15:46,999 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;@6b8b0b5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:15:47,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:15:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 251 states have (on average 1.6613545816733069) internal successors, (417), 263 states have internal predecessors, (417), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:15:47,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:47,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:47,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:47,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 968964661, now seen corresponding path program 1 times [2024-11-19 06:15:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082784069] [2024-11-19 06:15:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:47,038 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-19 06:15:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:47,040 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-19 06:15:47,042 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-19 06:15:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:47,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:15:47,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:47,209 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-19 06:15:47,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:47,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082784069] [2024-11-19 06:15:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082784069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:47,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:15:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493488150] [2024-11-19 06:15:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:47,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:15:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:47,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:15:47,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:15:47,242 INFO L87 Difference]: Start difference. First operand has 272 states, 251 states have (on average 1.6613545816733069) internal successors, (417), 263 states have internal predecessors, (417), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 06:15:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:47,285 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2024-11-19 06:15:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:15:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-11-19 06:15:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:47,307 INFO L225 Difference]: With dead ends: 271 [2024-11-19 06:15:47,307 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 06:15:47,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:15:47,313 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:47,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:15:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 06:15:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-19 06:15:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 260 states have internal predecessors, (328), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2024-11-19 06:15:47,437 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 11 [2024-11-19 06:15:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:47,438 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2024-11-19 06:15:47,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 06:15:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2024-11-19 06:15:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:15:47,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:47,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:47,454 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-19 06:15:47,647 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-19 06:15:47,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:47,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 513749610, now seen corresponding path program 1 times [2024-11-19 06:15:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123848764] [2024-11-19 06:15:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:47,649 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-19 06:15:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:47,652 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-19 06:15:47,653 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-19 06:15:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:47,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:15:47,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:47,829 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-19 06:15:47,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:47,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123848764] [2024-11-19 06:15:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123848764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:15:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88769608] [2024-11-19 06:15:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:15:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:47,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:15:47,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:15:47,836 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 06:15:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:48,035 INFO L93 Difference]: Finished difference Result 443 states and 586 transitions. [2024-11-19 06:15:48,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:15:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-19 06:15:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:48,045 INFO L225 Difference]: With dead ends: 443 [2024-11-19 06:15:48,045 INFO L226 Difference]: Without dead ends: 443 [2024-11-19 06:15:48,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:15:48,046 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 213 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:48,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 739 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:15:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-19 06:15:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 270. [2024-11-19 06:15:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 250 states have (on average 1.316) internal successors, (329), 261 states have internal predecessors, (329), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 361 transitions. [2024-11-19 06:15:48,064 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 361 transitions. Word has length 11 [2024-11-19 06:15:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:48,065 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 361 transitions. [2024-11-19 06:15:48,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 06:15:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 361 transitions. [2024-11-19 06:15:48,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:15:48,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:48,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:48,074 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-19 06:15:48,273 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-19 06:15:48,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:48,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 545084420, now seen corresponding path program 1 times [2024-11-19 06:15:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:48,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815684751] [2024-11-19 06:15:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:48,276 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-19 06:15:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:48,281 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-19 06:15:48,286 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-19 06:15:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:48,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:15:48,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:15:48,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:48,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:48,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815684751] [2024-11-19 06:15:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815684751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:48,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:48,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:15:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781672506] [2024-11-19 06:15:48,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:48,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:15:48,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:48,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:15:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:15:48,837 INFO L87 Difference]: Start difference. First operand 270 states and 361 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-19 06:15:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:48,954 INFO L93 Difference]: Finished difference Result 273 states and 356 transitions. [2024-11-19 06:15:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:15:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 117 [2024-11-19 06:15:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:48,956 INFO L225 Difference]: With dead ends: 273 [2024-11-19 06:15:48,957 INFO L226 Difference]: Without dead ends: 273 [2024-11-19 06:15:48,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-19 06:15:48,958 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 971 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:48,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 971 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:15:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-19 06:15:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-19 06:15:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 264 states have internal predecessors, (324), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 356 transitions. [2024-11-19 06:15:48,976 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 356 transitions. Word has length 117 [2024-11-19 06:15:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 356 transitions. [2024-11-19 06:15:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-19 06:15:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 356 transitions. [2024-11-19 06:15:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:15:48,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:48,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:48,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:15:49,184 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-19 06:15:49,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:49,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 471768592, now seen corresponding path program 1 times [2024-11-19 06:15:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113391232] [2024-11-19 06:15:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:49,186 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-19 06:15:49,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:49,189 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-19 06:15:49,190 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-19 06:15:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:49,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:15:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:15:49,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:49,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113391232] [2024-11-19 06:15:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113391232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:49,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:15:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379160441] [2024-11-19 06:15:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:49,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:15:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:15:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:15:49,787 INFO L87 Difference]: Start difference. First operand 273 states and 356 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-19 06:15:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:49,885 INFO L93 Difference]: Finished difference Result 267 states and 346 transitions. [2024-11-19 06:15:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:15:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 117 [2024-11-19 06:15:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:49,887 INFO L225 Difference]: With dead ends: 267 [2024-11-19 06:15:49,887 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 06:15:49,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-19 06:15:49,888 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:49,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:15:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 06:15:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-19 06:15:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 247 states have (on average 1.271255060728745) internal successors, (314), 258 states have internal predecessors, (314), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 346 transitions. [2024-11-19 06:15:49,901 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 346 transitions. Word has length 117 [2024-11-19 06:15:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:49,902 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 346 transitions. [2024-11-19 06:15:49,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-19 06:15:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 346 transitions. [2024-11-19 06:15:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:15:49,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:49,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:49,919 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-19 06:15:50,108 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-19 06:15:50,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1058044814, now seen corresponding path program 1 times [2024-11-19 06:15:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486668296] [2024-11-19 06:15:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:50,110 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-19 06:15:50,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:50,112 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-19 06:15:50,113 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-19 06:15:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:50,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:15:50,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:15:50,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:50,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:50,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486668296] [2024-11-19 06:15:50,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486668296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:50,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:50,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:15:50,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762515164] [2024-11-19 06:15:50,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:50,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:15:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:50,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:15:50,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:15:50,972 INFO L87 Difference]: Start difference. First operand 267 states and 346 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 06:15:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:51,805 INFO L93 Difference]: Finished difference Result 357 states and 453 transitions. [2024-11-19 06:15:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:15:51,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 117 [2024-11-19 06:15:51,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:51,814 INFO L225 Difference]: With dead ends: 357 [2024-11-19 06:15:51,815 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 06:15:51,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:15:51,816 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 69 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:51,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 692 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:15:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 06:15:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2024-11-19 06:15:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 283 states have (on average 1.2367491166077738) internal successors, (350), 294 states have internal predecessors, (350), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 06:15:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 382 transitions. [2024-11-19 06:15:51,841 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 382 transitions. Word has length 117 [2024-11-19 06:15:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 382 transitions. [2024-11-19 06:15:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 06:15:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2024-11-19 06:15:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 06:15:51,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:51,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:51,870 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-19 06:15:52,048 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-19 06:15:52,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:52,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1328039991, now seen corresponding path program 1 times [2024-11-19 06:15:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:52,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203182642] [2024-11-19 06:15:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:52,050 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-19 06:15:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:52,053 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-19 06:15:52,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:15:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:52,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:15:52,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:15:52,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:52,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203182642] [2024-11-19 06:15:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203182642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:15:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577653799] [2024-11-19 06:15:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:15:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:15:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:15:52,657 INFO L87 Difference]: Start difference. First operand 303 states and 382 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:15:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:52,724 INFO L93 Difference]: Finished difference Result 306 states and 387 transitions. [2024-11-19 06:15:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:15:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 132 [2024-11-19 06:15:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:52,727 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:15:52,727 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:15:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 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-19 06:15:52,728 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:15:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:15:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-19 06:15:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 285 states have (on average 1.2385964912280703) internal successors, (353), 297 states have internal predecessors, (353), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 06:15:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2024-11-19 06:15:52,745 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 132 [2024-11-19 06:15:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:52,745 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2024-11-19 06:15:52,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:15:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2024-11-19 06:15:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:15:52,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:52,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:15:52,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:15:52,948 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-19 06:15:52,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 735372331, now seen corresponding path program 1 times [2024-11-19 06:15:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119917999] [2024-11-19 06:15:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:15:52,950 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-19 06:15:52,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:52,952 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-19 06:15:52,953 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-19 06:15:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:15:53,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:15:53,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:15:53,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:15:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:15:53,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119917999] [2024-11-19 06:15:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119917999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:15:53,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:15:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:15:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227035357] [2024-11-19 06:15:53,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:15:53,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:15:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:15:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:15:53,560 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:15:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:15:53,782 INFO L93 Difference]: Finished difference Result 317 states and 404 transitions. [2024-11-19 06:15:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:15:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2024-11-19 06:15:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:15:53,784 INFO L225 Difference]: With dead ends: 317 [2024-11-19 06:15:53,784 INFO L226 Difference]: Without dead ends: 317 [2024-11-19 06:15:53,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:15:53,785 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:15:53,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1682 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:15:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-19 06:15:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2024-11-19 06:15:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 293 states have (on average 1.2525597269624573) internal successors, (367), 305 states have internal predecessors, (367), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-19 06:15:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 401 transitions. [2024-11-19 06:15:53,792 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 401 transitions. Word has length 134 [2024-11-19 06:15:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:15:53,792 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 401 transitions. [2024-11-19 06:15:53,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:15:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 401 transitions. [2024-11-19 06:15:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 06:15:53,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:15:53,794 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:15:53,807 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-19 06:15:53,994 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-19 06:15:53,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:15:53,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:15:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1396270839, now seen corresponding path program 2 times [2024-11-19 06:15:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:15:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283966534] [2024-11-19 06:15:53,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:15:53,996 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-19 06:15:53,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:15:53,997 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-19 06:15:53,998 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-19 06:15:54,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:15:54,258 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:15:54,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:15:54,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:15:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 06:15:55,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:15:55,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:15:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283966534] [2024-11-19 06:15:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283966534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:15:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:15:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:15:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347216569] [2024-11-19 06:15:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:15:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:15:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:15:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:15:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:15:55,269 INFO L87 Difference]: Start difference. First operand 315 states and 401 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-19 06:15:59,437 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-19 06:16:04,639 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-19 06:16:06,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:16:11,027 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-19 06:16:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:11,028 INFO L93 Difference]: Finished difference Result 398 states and 510 transitions. [2024-11-19 06:16:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:16:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 138 [2024-11-19 06:16:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:11,041 INFO L225 Difference]: With dead ends: 398 [2024-11-19 06:16:11,041 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 06:16:11,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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-19 06:16:11,042 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 46 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:11,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 959 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2024-11-19 06:16:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 06:16:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-19 06:16:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 373 states have (on average 1.257372654155496) internal successors, (469), 385 states have internal predecessors, (469), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-19 06:16:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 510 transitions. [2024-11-19 06:16:11,067 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 510 transitions. Word has length 138 [2024-11-19 06:16:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:11,067 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 510 transitions. [2024-11-19 06:16:11,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-19 06:16:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 510 transitions. [2024-11-19 06:16:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 06:16:11,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:11,069 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:11,075 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-19 06:16:11,270 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-19 06:16:11,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1072435231, now seen corresponding path program 1 times [2024-11-19 06:16:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798705392] [2024-11-19 06:16:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:11,273 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-19 06:16:11,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:11,276 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-19 06:16:11,278 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-19 06:16:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:11,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:16:11,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 06:16:12,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 06:16:12,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798705392] [2024-11-19 06:16:12,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798705392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:12,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:12,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:16:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625002653] [2024-11-19 06:16:12,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:12,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:16:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:16:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:16:12,233 INFO L87 Difference]: Start difference. First operand 398 states and 510 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:12,851 INFO L93 Difference]: Finished difference Result 413 states and 534 transitions. [2024-11-19 06:16:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:16:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 159 [2024-11-19 06:16:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:12,853 INFO L225 Difference]: With dead ends: 413 [2024-11-19 06:16:12,853 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 06:16:12,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:16:12,854 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 8 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:12,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2362 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:16:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 06:16:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2024-11-19 06:16:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 382 states have (on average 1.2591623036649215) internal successors, (481), 394 states have internal predecessors, (481), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-19 06:16:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2024-11-19 06:16:12,862 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 159 [2024-11-19 06:16:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:12,862 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2024-11-19 06:16:12,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2024-11-19 06:16:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 06:16:12,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:12,864 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:12,879 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-19 06:16:13,064 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-19 06:16:13,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:13,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash -647586373, now seen corresponding path program 2 times [2024-11-19 06:16:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:13,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515853749] [2024-11-19 06:16:13,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:13,067 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-19 06:16:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:13,070 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-19 06:16:13,076 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-19 06:16:13,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:16:13,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:13,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:16:13,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 263 proven. 55 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-19 06:16:13,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 1 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-19 06:16:14,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515853749] [2024-11-19 06:16:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515853749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:14,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:16:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336706341] [2024-11-19 06:16:14,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:14,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:16:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:16:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:16:14,422 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:16,130 INFO L93 Difference]: Finished difference Result 431 states and 564 transitions. [2024-11-19 06:16:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:16:16,132 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 177 [2024-11-19 06:16:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:16,133 INFO L225 Difference]: With dead ends: 431 [2024-11-19 06:16:16,133 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 06:16:16,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:16:16,135 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 14 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:16,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4383 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:16:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 06:16:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2024-11-19 06:16:16,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.2625) internal successors, (505), 412 states have internal predecessors, (505), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-19 06:16:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 546 transitions. [2024-11-19 06:16:16,142 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 546 transitions. Word has length 177 [2024-11-19 06:16:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:16,143 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 546 transitions. [2024-11-19 06:16:16,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 546 transitions. [2024-11-19 06:16:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-19 06:16:16,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:16,145 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:16,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:16:16,345 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-19 06:16:16,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1769409467, now seen corresponding path program 3 times [2024-11-19 06:16:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678713813] [2024-11-19 06:16:16,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:16:16,347 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-19 06:16:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:16,348 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-19 06:16:16,349 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-19 06:16:16,829 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:16:16,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:16,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:16,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-19 06:16:17,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-19 06:16:17,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678713813] [2024-11-19 06:16:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678713813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:17,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:16:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722852560] [2024-11-19 06:16:17,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:16:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:16:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:16:17,325 INFO L87 Difference]: Start difference. First operand 425 states and 546 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:17,773 INFO L93 Difference]: Finished difference Result 815 states and 1034 transitions. [2024-11-19 06:16:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:16:17,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 213 [2024-11-19 06:16:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:17,776 INFO L225 Difference]: With dead ends: 815 [2024-11-19 06:16:17,776 INFO L226 Difference]: Without dead ends: 815 [2024-11-19 06:16:17,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:16:17,777 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 774 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:17,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1552 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:16:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-19 06:16:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2024-11-19 06:16:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 775 states have (on average 1.2361290322580645) internal successors, (958), 787 states have internal predecessors, (958), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-19 06:16:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1034 transitions. [2024-11-19 06:16:17,790 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1034 transitions. Word has length 213 [2024-11-19 06:16:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1034 transitions. [2024-11-19 06:16:17,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1034 transitions. [2024-11-19 06:16:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-19 06:16:17,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:17,798 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:17,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:16:17,998 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-19 06:16:17,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:17,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 850507879, now seen corresponding path program 1 times [2024-11-19 06:16:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455001643] [2024-11-19 06:16:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:18,000 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-19 06:16:18,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:18,001 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-19 06:16:18,002 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-19 06:16:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:19,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:16:19,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 1202 proven. 253 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-11-19 06:16:20,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 112 proven. 1340 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2024-11-19 06:16:21,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455001643] [2024-11-19 06:16:21,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455001643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:21,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:21,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:16:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169556712] [2024-11-19 06:16:21,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:16:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:16:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:16:21,697 INFO L87 Difference]: Start difference. First operand 815 states and 1034 transitions. Second operand has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:27,408 INFO L93 Difference]: Finished difference Result 855 states and 1113 transitions. [2024-11-19 06:16:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:16:27,409 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 531 [2024-11-19 06:16:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:27,414 INFO L225 Difference]: With dead ends: 855 [2024-11-19 06:16:27,414 INFO L226 Difference]: Without dead ends: 851 [2024-11-19 06:16:27,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:16:27,417 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 25 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8094 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:27,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8094 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 06:16:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-19 06:16:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2024-11-19 06:16:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 809 states have (on average 1.2410383189122374) internal successors, (1004), 821 states have internal predecessors, (1004), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-19 06:16:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1080 transitions. [2024-11-19 06:16:27,435 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1080 transitions. Word has length 531 [2024-11-19 06:16:27,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:27,436 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1080 transitions. [2024-11-19 06:16:27,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:16:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1080 transitions. [2024-11-19 06:16:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-19 06:16:27,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:27,440 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:27,486 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-19 06:16:27,640 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-19 06:16:27,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:27,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1978091929, now seen corresponding path program 2 times [2024-11-19 06:16:27,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:27,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094937164] [2024-11-19 06:16:27,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:27,644 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-19 06:16:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:27,646 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-19 06:16:27,647 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-19 06:16:30,468 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:16:30,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:30,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 3735 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:16:30,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10099 backedges. 5967 proven. 276 refuted. 0 times theorem prover too weak. 3856 trivial. 0 not checked. [2024-11-19 06:16:31,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10099 backedges. 1194 proven. 1936 refuted. 0 times theorem prover too weak. 6969 trivial. 0 not checked. [2024-11-19 06:16:32,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094937164] [2024-11-19 06:16:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094937164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:32,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:32,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:16:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209895297] [2024-11-19 06:16:32,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:16:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:32,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:16:32,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:16:32,842 INFO L87 Difference]: Start difference. First operand 849 states and 1080 transitions. Second operand has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 06:16:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:40,056 INFO L93 Difference]: Finished difference Result 878 states and 1148 transitions. [2024-11-19 06:16:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:16:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 599 [2024-11-19 06:16:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:40,060 INFO L225 Difference]: With dead ends: 878 [2024-11-19 06:16:40,061 INFO L226 Difference]: Without dead ends: 878 [2024-11-19 06:16:40,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 1146 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:16:40,064 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 26 mSDsluCounter, 8378 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8717 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:40,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8717 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 06:16:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-19 06:16:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 874. [2024-11-19 06:16:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 834 states have (on average 1.26378896882494) internal successors, (1054), 846 states have internal predecessors, (1054), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-19 06:16:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1130 transitions. [2024-11-19 06:16:40,084 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1130 transitions. Word has length 599 [2024-11-19 06:16:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:40,085 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1130 transitions. [2024-11-19 06:16:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 06:16:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1130 transitions. [2024-11-19 06:16:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-19 06:16:40,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:40,090 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:40,151 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-19 06:16:40,290 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-19 06:16:40,291 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:40,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:40,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2068842805, now seen corresponding path program 3 times [2024-11-19 06:16:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016850999] [2024-11-19 06:16:40,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:16:40,294 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-19 06:16:40,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:40,297 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-19 06:16:40,299 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-19 06:16:41,288 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:16:41,288 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:41,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:41,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 18075 trivial. 0 not checked. [2024-11-19 06:16:41,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:41,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016850999] [2024-11-19 06:16:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016850999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:41,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228609877] [2024-11-19 06:16:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:41,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:41,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:41,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:41,349 INFO L87 Difference]: Start difference. First operand 874 states and 1130 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:16:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:41,426 INFO L93 Difference]: Finished difference Result 886 states and 1110 transitions. [2024-11-19 06:16:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:16:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 649 [2024-11-19 06:16:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:41,429 INFO L225 Difference]: With dead ends: 886 [2024-11-19 06:16:41,429 INFO L226 Difference]: Without dead ends: 886 [2024-11-19 06:16:41,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 647 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-19 06:16:41,430 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 30 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 926 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:41,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 926 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:16:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-19 06:16:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-19 06:16:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 846 states have (on average 1.2222222222222223) internal successors, (1034), 858 states have internal predecessors, (1034), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-19 06:16:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1110 transitions. [2024-11-19 06:16:41,460 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1110 transitions. Word has length 649 [2024-11-19 06:16:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1110 transitions. [2024-11-19 06:16:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:16:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1110 transitions. [2024-11-19 06:16:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-19 06:16:41,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:41,468 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:16:41,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:41,672 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-19 06:16:41,673 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:41,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 911370035, now seen corresponding path program 1 times [2024-11-19 06:16:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510695567] [2024-11-19 06:16:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:41,677 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-19 06:16:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:41,680 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-19 06:16:41,681 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-19 06:16:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:45,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:16:45,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 11167 proven. 1176 refuted. 0 times theorem prover too weak. 5881 trivial. 0 not checked. [2024-11-19 06:16:47,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 2319 proven. 5786 refuted. 0 times theorem prover too weak. 10119 trivial. 0 not checked. [2024-11-19 06:16:54,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510695567] [2024-11-19 06:16:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510695567] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:54,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:16:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645791189] [2024-11-19 06:16:54,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:54,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:16:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:16:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:16:54,136 INFO L87 Difference]: Start difference. First operand 886 states and 1110 transitions. Second operand has 102 states, 102 states have (on average 2.7254901960784315) internal successors, (278), 102 states have internal predecessors, (278), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)