./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_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_SFH_nondet_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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:26:19,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:26:19,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:26:19,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:26:19,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:26:19,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:26:19,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:26:19,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:26:19,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:26:19,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:26:19,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:26:19,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:26:19,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:26:19,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:26:19,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:26:19,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:26:19,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:26:19,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:26:19,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:26:19,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:26:19,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:26:19,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:26:19,612 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:26:19,613 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:26:19,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:26:19,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:26:19,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:26:19,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:26:19,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:26:19,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:26:19,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:26:19,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:26:19,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:26:19,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:26:19,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:26:19,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:26:19,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:19,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:26:19,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:26:19,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:26:19,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:26:19,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:26:19,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:26:19,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:26:19,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:26:19,619 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-19 06:26:19,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:26:19,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:26:19,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:26:19,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:26:19,881 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:26:19,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-19 06:26:21,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:26:21,786 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:26:21,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-19 06:26:21,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1fb88ca/6a77b942511942b4adb7faf4297182cd/FLAGbde503bd9 [2024-11-19 06:26:21,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1fb88ca/6a77b942511942b4adb7faf4297182cd [2024-11-19 06:26:21,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:26:21,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:26:21,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:21,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:26:21,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:26:21,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:21" (1/1) ... [2024-11-19 06:26:21,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cc2d69d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:21, skipping insertion in model container [2024-11-19 06:26:21,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:21" (1/1) ... [2024-11-19 06:26:21,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:22,566 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:26:22,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:26:22,623 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:26:22,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:26:22,643 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:26:22,679 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:26:22,681 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:26:22,706 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:26:22,711 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:26:22,724 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:26:22,728 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:26:22,734 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:26:22,758 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:26:22,758 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:26:22,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:26:22,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:26:22,762 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:26:22,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:26:22,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:26:22,765 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:26:22,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:22,784 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:26:22,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6c7d19a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:22, skipping insertion in model container [2024-11-19 06:26:22,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:22,785 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:26:22,787 INFO L158 Benchmark]: Toolchain (without parser) took 865.93ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 73.1MB in the beginning and 190.3MB in the end (delta: -117.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-19 06:26:22,787 INFO L158 Benchmark]: CDTParser took 1.25ms. Allocated memory is still 146.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:26:22,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 863.01ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 72.8MB in the beginning and 190.3MB in the end (delta: -117.5MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-19 06:26:22,789 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25ms. Allocated memory is still 146.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 863.01ms. Allocated memory was 146.8MB in the beginning and 226.5MB in the end (delta: 79.7MB). Free memory was 72.8MB in the beginning and 190.3MB in the end (delta: -117.5MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_SFH_nondet_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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:26:24,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:26:24,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:26:24,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:26:24,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:26:24,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:26:24,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:26:24,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:26:24,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:26:24,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:26:24,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:26:24,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:26:24,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:26:24,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:26:24,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:26:24,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:26:24,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:26:24,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:26:24,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:26:24,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:26:24,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:26:24,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:26:24,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:26:24,815 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:26:24,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:26:24,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:26:24,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:26:24,820 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:26:24,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:26:24,820 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:26:24,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:26:24,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:26:24,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:26:24,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:26:24,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:26:24,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:26:24,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:26:24,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:26:24,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:24,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:26:24,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:26:24,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:26:24,825 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-19 06:26:25,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:26:25,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:26:25,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:26:25,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:26:25,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:26:25,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-19 06:26:26,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:26:26,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:26:26,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-19 06:26:26,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9aad02a8/32a7dc18b44e4f948a5415e50e6a312c/FLAGd224a2b8f [2024-11-19 06:26:26,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9aad02a8/32a7dc18b44e4f948a5415e50e6a312c [2024-11-19 06:26:26,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:26:26,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:26:26,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:26,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:26:26,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:26:26,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:26" (1/1) ... [2024-11-19 06:26:26,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1126f2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:26, skipping insertion in model container [2024-11-19 06:26:26,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:26:26" (1/1) ... [2024-11-19 06:26:27,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:27,349 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:26:27,381 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:26:27,386 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:26:27,389 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:26:27,396 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:26:27,427 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:26:27,433 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:26:27,438 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:26:27,441 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:26:27,456 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:26:27,472 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:26:27,473 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:26:27,474 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:26:27,479 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:26:27,480 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:26:27,486 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:26:27,487 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:26:27,488 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:26:27,493 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:26:27,495 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:26:27,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:27,518 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:26:27,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:26:27,561 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:26:27,581 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:26:27,583 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:26:27,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:26:27,591 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:26:27,617 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:26:27,618 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:26:27,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:26:27,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:26:27,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:26:27,638 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:26:27,639 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:26:27,641 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:26:27,641 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:26:27,643 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:26:27,647 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:26:27,648 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:26:27,648 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:26:27,649 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:26:27,654 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:26:27,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:27,664 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:26:27,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:26:27,818 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:26:27,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27 WrapperNode [2024-11-19 06:26:27,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:26:27,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:26:27,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:26:27,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:26:27,828 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:26:27" (1/1) ... [2024-11-19 06:26:27,867 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:26:27" (1/1) ... [2024-11-19 06:26:27,936 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1431 [2024-11-19 06:26:27,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:26:27,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:26:27,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:26:27,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:26:27,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:27,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:27,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,166 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:26:28,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:26:28,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:26:28,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:26:28,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:26:28,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (1/1) ... [2024-11-19 06:26:28,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:26:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:26:28,299 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:26:28,302 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:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:26:28,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:26:28,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:26:28,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:26:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:26:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:26:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:26:28,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:26:28,538 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:26:28,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:26:41,891 INFO L? ?]: Removed 200 outVars from TransFormulas that were not future-live. [2024-11-19 06:26:41,891 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:26:41,911 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:26:41,911 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-19 06:26:41,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:41 BoogieIcfgContainer [2024-11-19 06:26:41,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:26:41,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:26:41,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:26:41,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:26:41,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:26:26" (1/3) ... [2024-11-19 06:26:41,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c60d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:41, skipping insertion in model container [2024-11-19 06:26:41,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:26:27" (2/3) ... [2024-11-19 06:26:41,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c60d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:26:41, skipping insertion in model container [2024-11-19 06:26:41,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:26:41" (3/3) ... [2024-11-19 06:26:41,925 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-3.i [2024-11-19 06:26:41,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:26:41,953 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:26:42,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:26:42,007 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;@74631492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:26:42,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:26:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:26:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:26:42,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:42,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:26:42,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1419139, now seen corresponding path program 1 times [2024-11-19 06:26:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:42,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716672771] [2024-11-19 06:26:42,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:42,031 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:26:42,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:42,035 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:26:42,039 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:26:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:42,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:26:42,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:42,194 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:26:42,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:42,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:42,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716672771] [2024-11-19 06:26:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716672771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:42,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:26:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365647785] [2024-11-19 06:26:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:26:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:26:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:26:42,221 INFO L87 Difference]: Start difference. First operand has 251 states, 241 states have (on average 1.6556016597510372) internal successors, (399), 243 states have internal predecessors, (399), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:46,296 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:26:50,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:26:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:26:51,533 INFO L93 Difference]: Finished difference Result 314 states and 409 transitions. [2024-11-19 06:26:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:26:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:26:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:26:51,559 INFO L225 Difference]: With dead ends: 314 [2024-11-19 06:26:51,559 INFO L226 Difference]: Without dead ends: 310 [2024-11-19 06:26:51,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:26:51,566 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 81 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:26:51,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 659 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-19 06:26:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-19 06:26:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2024-11-19 06:26:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 251 states have (on average 1.298804780876494) internal successors, (326), 252 states have internal predecessors, (326), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:26:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2024-11-19 06:26:51,673 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 4 [2024-11-19 06:26:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:26:51,673 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2024-11-19 06:26:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2024-11-19 06:26:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:26:51,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:26:51,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:26:51,678 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:26:51,875 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:26:51,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:26:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:26:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -227637592, now seen corresponding path program 1 times [2024-11-19 06:26:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:26:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952061293] [2024-11-19 06:26:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:26:51,878 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:26:51,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:26:51,880 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:26:51,881 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:26:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:26:52,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:26:52,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:26:52,085 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:26:52,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:26:52,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:26:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952061293] [2024-11-19 06:26:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952061293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:26:52,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:26:52,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:26:52,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518678143] [2024-11-19 06:26:52,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:26:52,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:26:52,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:26:52,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:26:52,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:26:52,088 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:26:56,468 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:27:00,577 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:27:03,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:27:07,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:27:08,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:27:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:08,894 INFO L93 Difference]: Finished difference Result 379 states and 492 transitions. [2024-11-19 06:27:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:27:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 06:27:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:08,900 INFO L225 Difference]: With dead ends: 379 [2024-11-19 06:27:08,900 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 06:27:08,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:27:08,901 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 156 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:08,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 882 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 16.8s Time] [2024-11-19 06:27:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 06:27:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-19 06:27:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 367 states have (on average 1.2915531335149864) internal successors, (474), 368 states have internal predecessors, (474), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:27:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 492 transitions. [2024-11-19 06:27:08,923 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 492 transitions. Word has length 11 [2024-11-19 06:27:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:08,924 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 492 transitions. [2024-11-19 06:27:08,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:27:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 492 transitions. [2024-11-19 06:27:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:27:08,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:08,925 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] [2024-11-19 06:27:08,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:27:09,125 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:27:09,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2107068027, now seen corresponding path program 1 times [2024-11-19 06:27:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420134013] [2024-11-19 06:27:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:09,128 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:27:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:09,130 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:27:09,131 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:27:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:09,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:27:09,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:27:09,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:09,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420134013] [2024-11-19 06:27:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420134013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:09,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:09,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:27:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861529309] [2024-11-19 06:27:09,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:09,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:27:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:09,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:27:09,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:27:09,319 INFO L87 Difference]: Start difference. First operand 379 states and 492 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:27:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:09,803 INFO L93 Difference]: Finished difference Result 431 states and 559 transitions. [2024-11-19 06:27:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:27:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:27:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:09,809 INFO L225 Difference]: With dead ends: 431 [2024-11-19 06:27:09,809 INFO L226 Difference]: Without dead ends: 431 [2024-11-19 06:27:09,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:27:09,811 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 121 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:09,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 608 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:27:09,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-19 06:27:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 377. [2024-11-19 06:27:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2876712328767124) internal successors, (470), 366 states have internal predecessors, (470), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:27:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2024-11-19 06:27:09,826 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 27 [2024-11-19 06:27:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2024-11-19 06:27:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:27:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2024-11-19 06:27:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:27:09,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:09,827 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] [2024-11-19 06:27:09,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:27:10,030 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:27:10,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:10,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:10,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1289419577, now seen corresponding path program 1 times [2024-11-19 06:27:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737268214] [2024-11-19 06:27:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:10,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:27:10,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:10,040 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:27:10,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 (5)] Waiting until timeout for monitored process [2024-11-19 06:27:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:10,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:27:10,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:10,275 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:27:10,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:10,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737268214] [2024-11-19 06:27:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737268214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:10,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:27:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863059355] [2024-11-19 06:27:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:27:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:27:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:27:10,277 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:27:14,523 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:27:18,830 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:27:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:22,388 INFO L93 Difference]: Finished difference Result 431 states and 558 transitions. [2024-11-19 06:27:22,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:27:22,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:27:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:22,392 INFO L225 Difference]: With dead ends: 431 [2024-11-19 06:27:22,392 INFO L226 Difference]: Without dead ends: 425 [2024-11-19 06:27:22,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:27:22,397 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 123 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:22,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 916 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-19 06:27:22,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-19 06:27:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 371. [2024-11-19 06:27:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 359 states have (on average 1.2896935933147633) internal successors, (463), 360 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:27:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 481 transitions. [2024-11-19 06:27:22,425 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 481 transitions. Word has length 27 [2024-11-19 06:27:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:22,427 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 481 transitions. [2024-11-19 06:27:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:27:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 481 transitions. [2024-11-19 06:27:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 06:27:22,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:22,435 INFO L215 NwaCegarLoop]: trace histogram [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:27:22,440 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:27:22,640 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:27:22,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:22,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1665770981, now seen corresponding path program 1 times [2024-11-19 06:27:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:22,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016622844] [2024-11-19 06:27:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:22,645 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:27:22,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:22,647 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:27:22,650 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:27:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:23,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:27:23,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:27:23,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:23,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016622844] [2024-11-19 06:27:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016622844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:23,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:27:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710616290] [2024-11-19 06:27:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:27:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:27:23,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:27:23,292 INFO L87 Difference]: Start difference. First operand 371 states and 481 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:27:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:23,395 INFO L93 Difference]: Finished difference Result 377 states and 471 transitions. [2024-11-19 06:27:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:27:23,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-19 06:27:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:23,397 INFO L225 Difference]: With dead ends: 377 [2024-11-19 06:27:23,397 INFO L226 Difference]: Without dead ends: 377 [2024-11-19 06:27:23,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 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:27:23,398 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 41 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:23,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 850 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:27:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-19 06:27:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-19 06:27:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 366 states have internal predecessors, (453), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:27:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-19 06:27:23,408 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 147 [2024-11-19 06:27:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-19 06:27:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:27:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-19 06:27:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 06:27:23,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:23,412 INFO L215 NwaCegarLoop]: trace histogram [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:27:23,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:27:23,616 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:27:23,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:23,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1359410743, now seen corresponding path program 1 times [2024-11-19 06:27:23,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:23,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771717355] [2024-11-19 06:27:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:23,618 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:27:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:23,619 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:27:23,621 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:27:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:24,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:27:24,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:27:24,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:24,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771717355] [2024-11-19 06:27:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771717355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:24,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:27:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011460829] [2024-11-19 06:27:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:24,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:27:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:27:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:27:24,231 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:27:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:24,319 INFO L93 Difference]: Finished difference Result 365 states and 451 transitions. [2024-11-19 06:27:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:27:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 147 [2024-11-19 06:27:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:24,320 INFO L225 Difference]: With dead ends: 365 [2024-11-19 06:27:24,320 INFO L226 Difference]: Without dead ends: 365 [2024-11-19 06:27:24,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 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:27:24,321 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 9 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:24,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 851 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:27:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-19 06:27:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-19 06:27:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.226628895184136) internal successors, (433), 354 states have internal predecessors, (433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 06:27:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 451 transitions. [2024-11-19 06:27:24,328 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 451 transitions. Word has length 147 [2024-11-19 06:27:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 451 transitions. [2024-11-19 06:27:24,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:27:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 451 transitions. [2024-11-19 06:27:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-19 06:27:24,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:24,330 INFO L215 NwaCegarLoop]: trace histogram [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:27:24,346 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:27:24,530 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:27:24,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -336215087, now seen corresponding path program 1 times [2024-11-19 06:27:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393202185] [2024-11-19 06:27:24,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:24,533 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:27:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:24,537 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:27:24,538 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:27:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:25,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:27:25,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 06:27:25,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:25,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393202185] [2024-11-19 06:27:25,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393202185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:25,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:25,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:27:25,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397160300] [2024-11-19 06:27:25,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:25,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:27:25,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:25,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:27:25,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:27:25,081 INFO L87 Difference]: Start difference. First operand 365 states and 451 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:27:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:25,121 INFO L93 Difference]: Finished difference Result 368 states and 457 transitions. [2024-11-19 06:27:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:27:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 147 [2024-11-19 06:27:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:25,124 INFO L225 Difference]: With dead ends: 368 [2024-11-19 06:27:25,125 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 06:27:25,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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:27:25,125 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 899 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:25,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 899 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:27:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 06:27:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-19 06:27:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 355 states have (on average 1.228169014084507) internal successors, (436), 357 states have internal predecessors, (436), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 457 transitions. [2024-11-19 06:27:25,133 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 457 transitions. Word has length 147 [2024-11-19 06:27:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 457 transitions. [2024-11-19 06:27:25,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:27:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 457 transitions. [2024-11-19 06:27:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 06:27:25,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:25,135 INFO L215 NwaCegarLoop]: trace histogram [4, 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:27:25,149 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:27:25,335 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:27:25,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -21562027, now seen corresponding path program 1 times [2024-11-19 06:27:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:25,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890891649] [2024-11-19 06:27:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:25,337 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:27:25,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:25,339 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:27:25,340 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:27:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:25,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:27:25,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 06:27:25,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 06:27:26,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:26,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890891649] [2024-11-19 06:27:26,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890891649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:26,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:26,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:27:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199741631] [2024-11-19 06:27:26,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:26,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:27:26,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:27:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:27:26,147 INFO L87 Difference]: Start difference. First operand 368 states and 457 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:26,291 INFO L93 Difference]: Finished difference Result 379 states and 475 transitions. [2024-11-19 06:27:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:27:26,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2024-11-19 06:27:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:26,293 INFO L225 Difference]: With dead ends: 379 [2024-11-19 06:27:26,293 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 06:27:26,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 294 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:27:26,294 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 5 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:26,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1195 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:27:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 06:27:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-11-19 06:27:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 363 states have (on average 1.2396694214876034) internal successors, (450), 365 states have internal predecessors, (450), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-11-19 06:27:26,302 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 151 [2024-11-19 06:27:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:26,302 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-11-19 06:27:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-11-19 06:27:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 06:27:26,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:26,303 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:27:26,320 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:27:26,504 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:27:26,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:26,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 427997521, now seen corresponding path program 2 times [2024-11-19 06:27:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009274366] [2024-11-19 06:27:26,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:27:26,506 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:27:26,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:26,507 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:27:26,509 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:27:27,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:27:27,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:27,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:27:27,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:27,197 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:27:27,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:27,363 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:27:27,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009274366] [2024-11-19 06:27:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009274366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:27,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:27:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018011681] [2024-11-19 06:27:27,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:27,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:27:27,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:27,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:27:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:27:27,366 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:27,818 INFO L93 Difference]: Finished difference Result 392 states and 495 transitions. [2024-11-19 06:27:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:27:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 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:27:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:27,821 INFO L225 Difference]: With dead ends: 392 [2024-11-19 06:27:27,821 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 06:27:27,821 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:27:27,822 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 8 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:27,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1794 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:27:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 06:27:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-19 06:27:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 372 states have (on average 1.2419354838709677) internal successors, (462), 374 states have internal predecessors, (462), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 483 transitions. [2024-11-19 06:27:27,829 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 483 transitions. Word has length 159 [2024-11-19 06:27:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:27,829 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 483 transitions. [2024-11-19 06:27:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 14 states have internal predecessors, (149), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 483 transitions. [2024-11-19 06:27:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 06:27:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:27,831 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:27:27,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:27:28,031 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:27:28,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:28,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1949202699, now seen corresponding path program 3 times [2024-11-19 06:27:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:28,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493749548] [2024-11-19 06:27:28,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:27:28,033 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:27:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:28,036 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:27:28,037 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:27:29,721 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 06:27:29,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:29,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:27:29,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-19 06:27:29,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-19 06:27:30,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493749548] [2024-11-19 06:27:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493749548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:30,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 06:27:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174045069] [2024-11-19 06:27:30,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:27:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:27:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:27:30,306 INFO L87 Difference]: Start difference. First operand 386 states and 483 transitions. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:27:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:31,142 INFO L93 Difference]: Finished difference Result 397 states and 502 transitions. [2024-11-19 06:27:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:27:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 177 [2024-11-19 06:27:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:31,145 INFO L225 Difference]: With dead ends: 397 [2024-11-19 06:27:31,145 INFO L226 Difference]: Without dead ends: 395 [2024-11-19 06:27:31,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:27:31,150 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 9 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:31,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2968 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:27:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-19 06:27:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-19 06:27:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 379 states have (on average 1.2532981530343008) internal successors, (475), 381 states have internal predecessors, (475), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-19 06:27:31,168 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 177 [2024-11-19 06:27:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:31,170 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-19 06:27:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:27:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-19 06:27:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 06:27:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:31,175 INFO L215 NwaCegarLoop]: trace histogram [44, 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:27:31,201 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:27:31,375 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:27:31,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:31,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -463141935, now seen corresponding path program 4 times [2024-11-19 06:27:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019214447] [2024-11-19 06:27:31,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 06:27:31,378 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:27:31,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:31,381 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:27:31,382 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:27:31,889 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 06:27:31,890 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:31,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:27:31,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-19 06:27:31,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:27:31,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019214447] [2024-11-19 06:27:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019214447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:27:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:27:31,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:27:31,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427489498] [2024-11-19 06:27:31,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:27:31,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:27:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:27:31,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:27:31,935 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:27:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:32,030 INFO L93 Difference]: Finished difference Result 433 states and 536 transitions. [2024-11-19 06:27:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:27:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-19 06:27:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:32,040 INFO L225 Difference]: With dead ends: 433 [2024-11-19 06:27:32,040 INFO L226 Difference]: Without dead ends: 433 [2024-11-19 06:27:32,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 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:27:32,041 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:32,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 557 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:27:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-19 06:27:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-11-19 06:27:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 419 states have (on average 1.2291169451073987) internal successors, (515), 421 states have internal predecessors, (515), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 536 transitions. [2024-11-19 06:27:32,048 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 536 transitions. Word has length 191 [2024-11-19 06:27:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:32,049 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 536 transitions. [2024-11-19 06:27:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:27:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 536 transitions. [2024-11-19 06:27:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-19 06:27:32,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:32,051 INFO L215 NwaCegarLoop]: trace histogram [44, 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:27:32,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:27:32,251 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:27:32,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:32,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1302175597, now seen corresponding path program 1 times [2024-11-19 06:27:32,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:32,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802426379] [2024-11-19 06:27:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:27:32,253 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:27:32,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:32,262 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:27:32,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:27:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:27:33,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:27:33,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 417 proven. 55 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-11-19 06:27:33,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 1 proven. 468 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-19 06:27:33,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:33,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802426379] [2024-11-19 06:27:33,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802426379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:33,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:33,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:27:33,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976300539] [2024-11-19 06:27:33,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:33,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:27:33,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:33,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:27:33,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:27:33,951 INFO L87 Difference]: Start difference. First operand 433 states and 536 transitions. Second operand has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:36,302 INFO L93 Difference]: Finished difference Result 451 states and 566 transitions. [2024-11-19 06:27:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:27:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 191 [2024-11-19 06:27:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:36,304 INFO L225 Difference]: With dead ends: 451 [2024-11-19 06:27:36,304 INFO L226 Difference]: Without dead ends: 447 [2024-11-19 06:27:36,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:27:36,305 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 13 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:36,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3583 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 06:27:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-19 06:27:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2024-11-19 06:27:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 431 states have (on average 1.222737819025522) internal successors, (527), 433 states have internal predecessors, (527), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 548 transitions. [2024-11-19 06:27:36,314 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 548 transitions. Word has length 191 [2024-11-19 06:27:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:36,315 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 548 transitions. [2024-11-19 06:27:36,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.1923076923076925) internal successors, (161), 26 states have internal predecessors, (161), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 548 transitions. [2024-11-19 06:27:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-19 06:27:36,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:36,317 INFO L215 NwaCegarLoop]: trace histogram [68, 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:27:36,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:27:36,520 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:27:36,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:36,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1257011091, now seen corresponding path program 2 times [2024-11-19 06:27:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:36,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315790236] [2024-11-19 06:27:36,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:27:36,523 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:27:36,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:36,525 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:27:36,526 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:27:37,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:27:37,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:37,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:27:37,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1137 proven. 253 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2024-11-19 06:27:38,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:27:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 1 proven. 1386 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-11-19 06:27:41,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:27:41,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315790236] [2024-11-19 06:27:41,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315790236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:27:41,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:27:41,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:27:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148317151] [2024-11-19 06:27:41,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:27:41,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:27:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:27:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:27:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:27:41,330 INFO L87 Difference]: Start difference. First operand 445 states and 548 transitions. Second operand has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:27:51,409 INFO L93 Difference]: Finished difference Result 484 states and 620 transitions. [2024-11-19 06:27:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:27:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 215 [2024-11-19 06:27:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:27:51,411 INFO L225 Difference]: With dead ends: 484 [2024-11-19 06:27:51,411 INFO L226 Difference]: Without dead ends: 480 [2024-11-19 06:27:51,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:27:51,414 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 25 mSDsluCounter, 6857 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7158 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:27:51,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7158 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-19 06:27:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-19 06:27:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2024-11-19 06:27:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 464 states have (on average 1.230603448275862) internal successors, (571), 466 states have internal predecessors, (571), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:27:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 592 transitions. [2024-11-19 06:27:51,424 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 592 transitions. Word has length 215 [2024-11-19 06:27:51,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:27:51,424 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 592 transitions. [2024-11-19 06:27:51,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.7) internal successors, (185), 50 states have internal predecessors, (185), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:27:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 592 transitions. [2024-11-19 06:27:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-19 06:27:51,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:27:51,427 INFO L215 NwaCegarLoop]: trace histogram [134, 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:27:51,450 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:27:51,631 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:27:51,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:27:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:27:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1258567283, now seen corresponding path program 3 times [2024-11-19 06:27:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:27:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678285570] [2024-11-19 06:27:51,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:27:51,634 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:27:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:27:51,637 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:27:51,639 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:27:55,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-19 06:27:55,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:27:55,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:27:55,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:27:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 2743 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-19 06:27:56,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:28:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 2743 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-19 06:28:00,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:28:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678285570] [2024-11-19 06:28:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678285570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:28:00,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:28:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:28:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972551008] [2024-11-19 06:28:00,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:28:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:28:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:28:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:28:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:28:00,065 INFO L87 Difference]: Start difference. First operand 478 states and 592 transitions. Second operand has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)