./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:27:19,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:27:19,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-22 18:27:20,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:27:20,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:27:20,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:27:20,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:27:20,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:27:20,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:27:20,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:27:20,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:27:20,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:27:20,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:27:20,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:27:20,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:27:20,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:27:20,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:27:20,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:27:20,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:27:20,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:27:20,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:27:20,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:27:20,030 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:27:20,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:27:20,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:27:20,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:27:20,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:27:20,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:27:20,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:27:20,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:27:20,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:27:20,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:27:20,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:27:20,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:27:20,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:27:20,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:27:20,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:27:20,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:27:20,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:27:20,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:27:20,038 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-11-22 18:27:20,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:27:20,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:27:20,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:27:20,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:27:20,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:27:20,291 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_test6-2.i [2024-11-22 18:27:21,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:27:21,810 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:27:21,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-22 18:27:21,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691bea8b9/6ad167706c814b03b965983c14d26042/FLAG150e1f5f9 [2024-11-22 18:27:22,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691bea8b9/6ad167706c814b03b965983c14d26042 [2024-11-22 18:27:22,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:27:22,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:27:22,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:27:22,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:27:22,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:27:22,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:27:22" (1/1) ... [2024-11-22 18:27:22,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3d7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:22, skipping insertion in model container [2024-11-22 18:27:22,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:27:22" (1/1) ... [2024-11-22 18:27:22,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:27:22,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:27:22,725 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-22 18:27:22,727 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-22 18:27:22,729 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-22 18:27:22,736 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:27:22,767 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-22 18:27:22,770 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:27:22,772 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-22 18:27:22,773 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:27:22,778 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:27:22,779 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-22 18:27:22,779 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-22 18:27:22,780 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-22 18:27:22,783 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-22 18:27:22,783 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-22 18:27:22,785 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-22 18:27:22,786 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-22 18:27:22,786 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-22 18:27:22,787 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-22 18:27:22,791 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-22 18:27:22,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:27:22,820 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-22 18:27:22,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@17952661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:22, skipping insertion in model container [2024-11-22 18:27:22,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:27:22,822 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:27:22,823 INFO L158 Benchmark]: Toolchain (without parser) took 698.04ms. Allocated memory is still 176.2MB. Free memory was 105.0MB in the beginning and 136.1MB in the end (delta: -31.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:27:22,823 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:27:22,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.87ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 136.1MB in the end (delta: -31.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:27:22,825 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 102.8MB. Free memory is still 64.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.87ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 136.1MB in the end (delta: -31.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:27:24,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:27:24,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-22 18:27:24,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:27:24,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:27:24,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:27:24,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:27:24,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:27:24,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:27:24,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:27:24,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:27:24,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:27:24,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:27:24,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:27:24,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:27:24,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:27:24,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:27:24,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:27:24,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:27:24,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:27:24,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:27:24,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:27:24,663 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:27:24,663 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:27:24,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:27:24,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:27:24,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:27:24,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:27:24,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:27:24,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:27:24,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:27:24,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:27:24,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:27:24,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:27:24,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:27:24,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:27:24,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:27:24,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:27:24,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:27:24,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:27:24,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:27:24,666 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:27:24,666 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:27:24,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:27:24,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:27:24,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:27:24,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:27:24,667 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2024-11-22 18:27:24,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:27:24,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:27:24,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:27:24,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:27:24,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:27:24,967 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_test6-2.i [2024-11-22 18:27:26,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:27:26,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:27:26,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2024-11-22 18:27:26,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70965be31/78125c946d5a4d5d8f2bda89aa2f06af/FLAG94ff90f32 [2024-11-22 18:27:26,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70965be31/78125c946d5a4d5d8f2bda89aa2f06af [2024-11-22 18:27:26,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:27:26,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:27:26,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:27:26,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:27:26,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:27:26,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:27:26" (1/1) ... [2024-11-22 18:27:26,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7b15c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:26, skipping insertion in model container [2024-11-22 18:27:26,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:27:26" (1/1) ... [2024-11-22 18:27:26,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:27:27,010 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-22 18:27:27,031 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-22 18:27:27,038 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-22 18:27:27,046 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-22 18:27:27,053 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-22 18:27:27,081 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-22 18:27:27,081 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-22 18:27:27,083 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-22 18:27:27,083 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-22 18:27:27,086 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-22 18:27:27,092 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-22 18:27:27,095 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-22 18:27:27,096 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-22 18:27:27,100 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-22 18:27:27,102 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-22 18:27:27,109 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-22 18:27:27,109 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-22 18:27:27,110 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-22 18:27:27,113 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-22 18:27:27,117 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-22 18:27:27,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:27:27,134 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:27:27,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:27:27,163 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-22 18:27:27,183 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-22 18:27:27,184 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-22 18:27:27,186 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-22 18:27:27,189 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-22 18:27:27,202 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-22 18:27:27,203 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-22 18:27:27,204 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-22 18:27:27,205 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-22 18:27:27,207 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-22 18:27:27,207 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-22 18:27:27,208 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-22 18:27:27,209 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-22 18:27:27,211 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-22 18:27:27,211 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-22 18:27:27,213 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-22 18:27:27,213 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-22 18:27:27,214 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-22 18:27:27,214 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-22 18:27:27,217 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-22 18:27:27,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:27:27,222 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:27:27,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:27:27,366 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:27:27,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27 WrapperNode [2024-11-22 18:27:27,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:27:27,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:27:27,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:27:27,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:27:27,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,476 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1233 [2024-11-22 18:27:27,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:27:27,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:27:27,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:27:27,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:27:27,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,567 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-22 18:27:27,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:27:27,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:27:27,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:27:27,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:27:27,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (1/1) ... [2024-11-22 18:27:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:27:27,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:27:27,678 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-22 18:27:27,683 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-22 18:27:27,720 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 18:27:27,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:27:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 18:27:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-22 18:27:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:27:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:27:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:27:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:27:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-22 18:27:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:27:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 18:27:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 18:27:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 18:27:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-22 18:27:27,725 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 18:27:27,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-22 18:27:27,725 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:27:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:27:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:27:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-22 18:27:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-22 18:27:27,726 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-22 18:27:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:27:27,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:27:27,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:27:27,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:27:32,622 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-11-22 18:27:32,622 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:27:32,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:27:32,646 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-22 18:27:32,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:27:32 BoogieIcfgContainer [2024-11-22 18:27:32,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:27:32,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:27:32,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:27:32,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:27:32,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:27:26" (1/3) ... [2024-11-22 18:27:32,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3dc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:27:32, skipping insertion in model container [2024-11-22 18:27:32,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:27:27" (2/3) ... [2024-11-22 18:27:32,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3dc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:27:32, skipping insertion in model container [2024-11-22 18:27:32,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:27:32" (3/3) ... [2024-11-22 18:27:32,653 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-2.i [2024-11-22 18:27:32,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:27:32,665 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 18:27:32,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:27:32,706 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;@2c7c4a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:27:32,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 18:27:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 18:27:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 18:27:32,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:32,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:32,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:32,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1647492033, now seen corresponding path program 1 times [2024-11-22 18:27:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:32,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919700398] [2024-11-22 18:27:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:32,733 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-22 18:27:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:32,736 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-22 18:27:32,737 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-22 18:27:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:32,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:27:32,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:32,911 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-22 18:27:32,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:32,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:32,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919700398] [2024-11-22 18:27:32,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919700398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:32,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:32,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:27:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209581035] [2024-11-22 18:27:32,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:27:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:32,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:27:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:27:32,937 INFO L87 Difference]: Start difference. First operand has 269 states, 242 states have (on average 1.6074380165289257) internal successors, (389), 247 states have internal predecessors, (389), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:32,984 INFO L93 Difference]: Finished difference Result 264 states and 342 transitions. [2024-11-22 18:27:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:27:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 18:27:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:32,998 INFO L225 Difference]: With dead ends: 264 [2024-11-22 18:27:32,998 INFO L226 Difference]: Without dead ends: 262 [2024-11-22 18:27:33,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 18:27:33,004 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:33,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:27:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-22 18:27:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-11-22 18:27:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 237 states have (on average 1.2911392405063291) internal successors, (306), 242 states have internal predecessors, (306), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 18:27:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-11-22 18:27:33,051 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 10 [2024-11-22 18:27:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:33,051 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-11-22 18:27:33,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-11-22 18:27:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:27:33,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:33,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:33,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 18:27:33,253 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-22 18:27:33,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:33,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:33,255 INFO L85 PathProgramCache]: Analyzing trace with hash -617339998, now seen corresponding path program 1 times [2024-11-22 18:27:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:33,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320846524] [2024-11-22 18:27:33,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:33,255 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-22 18:27:33,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:33,260 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-22 18:27:33,277 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-22 18:27:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:33,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:27:33,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:33,525 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-22 18:27:33,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:33,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320846524] [2024-11-22 18:27:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320846524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:33,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:33,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:27:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739090178] [2024-11-22 18:27:33,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:33,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:27:33,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:27:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:27:33,528 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:35,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 18:27:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:37,246 INFO L93 Difference]: Finished difference Result 418 states and 545 transitions. [2024-11-22 18:27:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:27:37,248 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 18:27:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:37,249 INFO L225 Difference]: With dead ends: 418 [2024-11-22 18:27:37,249 INFO L226 Difference]: Without dead ends: 418 [2024-11-22 18:27:37,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-22 18:27:37,250 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 186 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:37,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 971 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-22 18:27:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-22 18:27:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 381. [2024-11-22 18:27:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 353 states have (on average 1.2946175637393769) internal successors, (457), 358 states have internal predecessors, (457), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 18:27:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2024-11-22 18:27:37,295 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 12 [2024-11-22 18:27:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:37,295 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2024-11-22 18:27:37,296 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2024-11-22 18:27:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:27:37,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:37,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:37,300 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-22 18:27:37,497 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-22 18:27:37,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:37,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -919823020, now seen corresponding path program 1 times [2024-11-22 18:27:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458742845] [2024-11-22 18:27:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:37,499 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-22 18:27:37,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:37,501 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-22 18:27:37,503 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-22 18:27:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:37,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:27:37,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:37,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:37,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:37,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:37,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-22 18:27:37,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:27:37,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-22 18:27:37,796 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-22 18:27:37,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:37,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458742845] [2024-11-22 18:27:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458742845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:27:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240924278] [2024-11-22 18:27:37,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:27:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:27:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:27:37,799 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:38,164 INFO L93 Difference]: Finished difference Result 596 states and 785 transitions. [2024-11-22 18:27:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:27:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 18:27:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:38,167 INFO L225 Difference]: With dead ends: 596 [2024-11-22 18:27:38,167 INFO L226 Difference]: Without dead ends: 596 [2024-11-22 18:27:38,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-22 18:27:38,168 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 274 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:38,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1050 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:27:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-22 18:27:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 380. [2024-11-22 18:27:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 352 states have (on average 1.2926136363636365) internal successors, (455), 357 states have internal predecessors, (455), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 18:27:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 495 transitions. [2024-11-22 18:27:38,180 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 495 transitions. Word has length 15 [2024-11-22 18:27:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:38,180 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 495 transitions. [2024-11-22 18:27:38,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 495 transitions. [2024-11-22 18:27:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-22 18:27:38,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:38,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:38,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:27:38,382 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-22 18:27:38,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:38,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2120572721, now seen corresponding path program 1 times [2024-11-22 18:27:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:38,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482543659] [2024-11-22 18:27:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:38,386 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-22 18:27:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:38,388 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-22 18:27:38,389 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-22 18:27:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:38,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:27:38,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:38,612 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-22 18:27:38,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:38,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482543659] [2024-11-22 18:27:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482543659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:27:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355997002] [2024-11-22 18:27:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:27:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:27:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:27:38,614 INFO L87 Difference]: Start difference. First operand 380 states and 495 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:38,689 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2024-11-22 18:27:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:27:38,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-22 18:27:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:38,690 INFO L225 Difference]: With dead ends: 386 [2024-11-22 18:27:38,691 INFO L226 Difference]: Without dead ends: 386 [2024-11-22 18:27:38,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-22 18:27:38,691 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 30 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:38,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 911 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:27:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-22 18:27:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-11-22 18:27:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 363 states have internal predecessors, (445), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 18:27:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 485 transitions. [2024-11-22 18:27:38,700 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 485 transitions. Word has length 50 [2024-11-22 18:27:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:38,700 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 485 transitions. [2024-11-22 18:27:38,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 485 transitions. [2024-11-22 18:27:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-22 18:27:38,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:38,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:38,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 18:27:38,901 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-22 18:27:38,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1719810523, now seen corresponding path program 1 times [2024-11-22 18:27:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489823628] [2024-11-22 18:27:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:38,903 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-22 18:27:38,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:38,906 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-22 18:27:38,906 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-22 18:27:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:39,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:27:39,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:39,159 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-22 18:27:39,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:39,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489823628] [2024-11-22 18:27:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489823628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:27:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423344951] [2024-11-22 18:27:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:39,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:27:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:27:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:27:39,163 INFO L87 Difference]: Start difference. First operand 386 states and 485 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:39,232 INFO L93 Difference]: Finished difference Result 396 states and 495 transitions. [2024-11-22 18:27:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:27:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-22 18:27:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:39,234 INFO L225 Difference]: With dead ends: 396 [2024-11-22 18:27:39,234 INFO L226 Difference]: Without dead ends: 396 [2024-11-22 18:27:39,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:27:39,235 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 9 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:39,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1611 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:27:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-22 18:27:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-22 18:27:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 371 states have internal predecessors, (453), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 18:27:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 495 transitions. [2024-11-22 18:27:39,245 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 495 transitions. Word has length 50 [2024-11-22 18:27:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:39,246 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 495 transitions. [2024-11-22 18:27:39,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:27:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 495 transitions. [2024-11-22 18:27:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 18:27:39,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:39,248 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:39,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:27:39,452 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-22 18:27:39,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2051735363, now seen corresponding path program 1 times [2024-11-22 18:27:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080956177] [2024-11-22 18:27:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:39,454 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-22 18:27:39,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:39,456 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-22 18:27:39,457 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-22 18:27:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:39,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:27:39,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:27:39,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:39,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080956177] [2024-11-22 18:27:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080956177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:27:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932146403] [2024-11-22 18:27:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:27:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:27:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:27:39,833 INFO L87 Difference]: Start difference. First operand 396 states and 495 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:27:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:39,999 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-22 18:27:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:27:40,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-22 18:27:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:40,003 INFO L225 Difference]: With dead ends: 404 [2024-11-22 18:27:40,003 INFO L226 Difference]: Without dead ends: 404 [2024-11-22 18:27:40,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:27:40,004 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 20 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:40,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1178 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:27:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-22 18:27:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2024-11-22 18:27:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 367 states have (on average 1.2397820163487738) internal successors, (455), 374 states have internal predecessors, (455), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-22 18:27:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 500 transitions. [2024-11-22 18:27:40,014 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 500 transitions. Word has length 65 [2024-11-22 18:27:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:40,014 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 500 transitions. [2024-11-22 18:27:40,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:27:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 500 transitions. [2024-11-22 18:27:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 18:27:40,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:40,016 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:40,028 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-22 18:27:40,216 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-22 18:27:40,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:40,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2090919877, now seen corresponding path program 1 times [2024-11-22 18:27:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247744342] [2024-11-22 18:27:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:40,219 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-22 18:27:40,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:40,221 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-22 18:27:40,222 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-22 18:27:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:40,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:27:40,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:27:40,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:40,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247744342] [2024-11-22 18:27:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247744342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:27:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961501673] [2024-11-22 18:27:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:40,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:27:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:27:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:27:40,591 INFO L87 Difference]: Start difference. First operand 400 states and 500 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:27:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:40,621 INFO L93 Difference]: Finished difference Result 404 states and 505 transitions. [2024-11-22 18:27:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:27:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-22 18:27:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:40,623 INFO L225 Difference]: With dead ends: 404 [2024-11-22 18:27:40,624 INFO L226 Difference]: Without dead ends: 404 [2024-11-22 18:27:40,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-22 18:27:40,625 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:40,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 970 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:27:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-22 18:27:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-22 18:27:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 378 states have internal predecessors, (459), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-22 18:27:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 505 transitions. [2024-11-22 18:27:40,636 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 505 transitions. Word has length 70 [2024-11-22 18:27:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 505 transitions. [2024-11-22 18:27:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:27:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 505 transitions. [2024-11-22 18:27:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 18:27:40,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:40,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:40,646 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 (8)] Forceful destruction successful, exit code 0 [2024-11-22 18:27:40,837 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-22 18:27:40,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:40,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -731053154, now seen corresponding path program 1 times [2024-11-22 18:27:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226758823] [2024-11-22 18:27:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:40,840 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-22 18:27:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:40,842 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-22 18:27:40,843 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-22 18:27:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:41,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:27:41,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:27:41,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:27:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:27:41,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226758823] [2024-11-22 18:27:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226758823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:27:41,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:27:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 18:27:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039560026] [2024-11-22 18:27:41,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:27:41,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:27:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:27:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:27:41,373 INFO L87 Difference]: Start difference. First operand 404 states and 505 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:27:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:41,566 INFO L93 Difference]: Finished difference Result 417 states and 523 transitions. [2024-11-22 18:27:41,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:27:41,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-22 18:27:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:41,569 INFO L225 Difference]: With dead ends: 417 [2024-11-22 18:27:41,569 INFO L226 Difference]: Without dead ends: 417 [2024-11-22 18:27:41,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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-22 18:27:41,569 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 5 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:41,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1289 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:27:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-22 18:27:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-11-22 18:27:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 379 states have (on average 1.2506596306068603) internal successors, (474), 387 states have internal predecessors, (474), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-22 18:27:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 520 transitions. [2024-11-22 18:27:41,577 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 520 transitions. Word has length 71 [2024-11-22 18:27:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:41,577 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 520 transitions. [2024-11-22 18:27:41,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:27:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 520 transitions. [2024-11-22 18:27:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 18:27:41,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:41,578 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:41,587 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-22 18:27:41,779 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-22 18:27:41,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:41,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash 481662469, now seen corresponding path program 2 times [2024-11-22 18:27:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878250521] [2024-11-22 18:27:41,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:27:41,781 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-22 18:27:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:41,783 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-22 18:27:41,784 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-22 18:27:42,274 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:27:42,275 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:27:42,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:27:42,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:27:42,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:27:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:27:42,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878250521] [2024-11-22 18:27:42,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878250521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:27:42,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:27:42,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 18:27:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086258421] [2024-11-22 18:27:42,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:27:42,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:27:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:27:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:27:42,748 INFO L87 Difference]: Start difference. First operand 414 states and 520 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:27:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:44,396 INFO L93 Difference]: Finished difference Result 3135 states and 4016 transitions. [2024-11-22 18:27:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 18:27:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-22 18:27:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:44,406 INFO L225 Difference]: With dead ends: 3135 [2024-11-22 18:27:44,406 INFO L226 Difference]: Without dead ends: 3135 [2024-11-22 18:27:44,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-22 18:27:44,407 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 3339 mSDsluCounter, 5321 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:44,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 6223 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 18:27:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2024-11-22 18:27:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2156. [2024-11-22 18:27:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2018 states have (on average 1.265609514370664) internal successors, (2554), 2039 states have internal predecessors, (2554), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-22 18:27:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2754 transitions. [2024-11-22 18:27:44,449 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2754 transitions. Word has length 74 [2024-11-22 18:27:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:44,449 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 2754 transitions. [2024-11-22 18:27:44,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:27:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2754 transitions. [2024-11-22 18:27:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-22 18:27:44,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:44,450 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:44,462 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-22 18:27:44,654 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-22 18:27:44,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:44,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 91174169, now seen corresponding path program 1 times [2024-11-22 18:27:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:44,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588196246] [2024-11-22 18:27:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:44,656 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-22 18:27:44,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:44,657 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-22 18:27:44,658 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-22 18:27:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:45,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:27:45,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:27:45,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:27:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-22 18:27:45,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588196246] [2024-11-22 18:27:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588196246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:27:45,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:27:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 18:27:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567022028] [2024-11-22 18:27:45,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:27:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:27:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:45,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:27:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:27:45,450 INFO L87 Difference]: Start difference. First operand 2156 states and 2754 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:27:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:45,987 INFO L93 Difference]: Finished difference Result 2246 states and 2879 transitions. [2024-11-22 18:27:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:27:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-22 18:27:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:45,994 INFO L225 Difference]: With dead ends: 2246 [2024-11-22 18:27:45,995 INFO L226 Difference]: Without dead ends: 2216 [2024-11-22 18:27:45,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:27:45,995 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 8 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:45,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1933 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:27:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-11-22 18:27:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2201. [2024-11-22 18:27:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2063 states have (on average 1.2670867668444012) internal successors, (2614), 2084 states have internal predecessors, (2614), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-22 18:27:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2814 transitions. [2024-11-22 18:27:46,024 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2814 transitions. Word has length 110 [2024-11-22 18:27:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:46,024 INFO L471 AbstractCegarLoop]: Abstraction has 2201 states and 2814 transitions. [2024-11-22 18:27:46,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-22 18:27:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2814 transitions. [2024-11-22 18:27:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-22 18:27:46,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:46,026 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:46,040 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-22 18:27:46,229 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-22 18:27:46,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:46,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1756987024, now seen corresponding path program 2 times [2024-11-22 18:27:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680931452] [2024-11-22 18:27:46,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:27:46,231 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-22 18:27:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:46,234 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-22 18:27:46,235 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-22 18:27:46,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:27:46,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:27:46,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:27:46,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:46,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:46,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:46,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:27:46,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-22 18:27:46,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:27:46,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-22 18:27:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-22 18:27:46,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:27:46,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680931452] [2024-11-22 18:27:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680931452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:27:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:27:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:27:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842204608] [2024-11-22 18:27:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:27:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:27:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:46,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:27:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:27:46,624 INFO L87 Difference]: Start difference. First operand 2201 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 18:27:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:47,031 INFO L93 Difference]: Finished difference Result 2971 states and 3834 transitions. [2024-11-22 18:27:47,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:27:47,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-22 18:27:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:47,040 INFO L225 Difference]: With dead ends: 2971 [2024-11-22 18:27:47,040 INFO L226 Difference]: Without dead ends: 2971 [2024-11-22 18:27:47,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-22 18:27:47,041 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 215 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:47,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 913 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:27:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-11-22 18:27:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2213. [2024-11-22 18:27:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2075 states have (on average 1.2655421686746988) internal successors, (2626), 2096 states have internal predecessors, (2626), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-22 18:27:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2826 transitions. [2024-11-22 18:27:47,083 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2826 transitions. Word has length 119 [2024-11-22 18:27:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:47,084 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 2826 transitions. [2024-11-22 18:27:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 18:27:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2826 transitions. [2024-11-22 18:27:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 18:27:47,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:47,087 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:47,092 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-22 18:27:47,287 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-22 18:27:47,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1356606875, now seen corresponding path program 1 times [2024-11-22 18:27:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673939147] [2024-11-22 18:27:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:27:47,289 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-22 18:27:47,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:47,291 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-22 18:27:47,292 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-22 18:27:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:27:47,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:27:47,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 18:27:48,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:27:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-22 18:27:48,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673939147] [2024-11-22 18:27:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673939147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:27:48,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:27:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 18:27:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532108016] [2024-11-22 18:27:48,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:27:48,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 18:27:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 18:27:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 18:27:48,700 INFO L87 Difference]: Start difference. First operand 2213 states and 2826 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 18:27:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:27:50,998 INFO L93 Difference]: Finished difference Result 2348 states and 3041 transitions. [2024-11-22 18:27:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 18:27:50,999 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-22 18:27:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:27:51,005 INFO L225 Difference]: With dead ends: 2348 [2024-11-22 18:27:51,005 INFO L226 Difference]: Without dead ends: 2318 [2024-11-22 18:27:51,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 18:27:51,006 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 14 mSDsluCounter, 4172 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:27:51,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4497 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:27:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-22 18:27:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2303. [2024-11-22 18:27:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2165 states have (on average 1.2683602771362588) internal successors, (2746), 2186 states have internal predecessors, (2746), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-22 18:27:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 2946 transitions. [2024-11-22 18:27:51,032 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 2946 transitions. Word has length 126 [2024-11-22 18:27:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:27:51,032 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 2946 transitions. [2024-11-22 18:27:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 18:27:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2946 transitions. [2024-11-22 18:27:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-22 18:27:51,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:27:51,034 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:27:51,048 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-22 18:27:51,237 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-22 18:27:51,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:27:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:27:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1020044859, now seen corresponding path program 2 times [2024-11-22 18:27:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:27:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898380493] [2024-11-22 18:27:51,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:27:51,239 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-22 18:27:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:27:51,241 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-22 18:27:51,242 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-22 18:27:52,247 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:27:52,248 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:27:52,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:27:52,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:27:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-22 18:27:52,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:27:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-22 18:27:54,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:27:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898380493] [2024-11-22 18:27:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898380493] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:27:54,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:27:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 18:27:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99734950] [2024-11-22 18:27:54,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:27:54,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 18:27:54,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:27:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 18:27:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:27:54,500 INFO L87 Difference]: Start difference. First operand 2303 states and 2946 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 18:28:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:28:04,736 INFO L93 Difference]: Finished difference Result 2518 states and 3321 transitions. [2024-11-22 18:28:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 18:28:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-22 18:28:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:28:04,747 INFO L225 Difference]: With dead ends: 2518 [2024-11-22 18:28:04,747 INFO L226 Difference]: Without dead ends: 2488 [2024-11-22 18:28:04,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 18:28:04,750 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 25 mSDsluCounter, 7705 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8030 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:28:04,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8030 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 18:28:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-22 18:28:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2473. [2024-11-22 18:28:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2335 states have (on average 1.2745182012847966) internal successors, (2976), 2356 states have internal predecessors, (2976), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-22 18:28:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3176 transitions. [2024-11-22 18:28:04,775 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3176 transitions. Word has length 144 [2024-11-22 18:28:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:28:04,775 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3176 transitions. [2024-11-22 18:28:04,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 18:28:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3176 transitions. [2024-11-22 18:28:04,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 18:28:04,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:28:04,777 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:28:04,797 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-22 18:28:04,977 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-22 18:28:04,978 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:28:04,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:28:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 873821541, now seen corresponding path program 3 times [2024-11-22 18:28:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:28:04,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086292510] [2024-11-22 18:28:04,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:28:04,980 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-22 18:28:04,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:28:04,982 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-22 18:28:04,983 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-22 18:28:06,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 18:28:06,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:28:06,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 18:28:06,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:28:06,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-11-22 18:28:06,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 277 [2024-11-22 18:28:06,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 181 [2024-11-22 18:28:06,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:28:06,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 85 [2024-11-22 18:28:07,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 457 treesize of output 337 [2024-11-22 18:28:07,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 217 [2024-11-22 18:28:07,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:28:07,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 97 [2024-11-22 18:28:08,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-22 18:28:08,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-22 18:28:08,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:28:08,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-11-22 18:28:08,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:28:08,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-11-22 18:28:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-22 18:28:08,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:28:08,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:28:08,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086292510] [2024-11-22 18:28:08,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086292510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:28:08,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:28:08,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 18:28:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334169059] [2024-11-22 18:28:08,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:28:08,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 18:28:08,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:28:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 18:28:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:28:08,744 INFO L87 Difference]: Start difference. First operand 2473 states and 3176 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 18:28:11,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:28:15,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 18:28:18,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 18:28:19,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:28:22,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:28:25,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:28:29,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 18:28:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:28:33,708 INFO L93 Difference]: Finished difference Result 2626 states and 3382 transitions. [2024-11-22 18:28:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 18:28:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-22 18:28:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:28:33,715 INFO L225 Difference]: With dead ends: 2626 [2024-11-22 18:28:33,715 INFO L226 Difference]: Without dead ends: 2626 [2024-11-22 18:28:33,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:28:33,715 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 50 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:28:33,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2735 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 642 Invalid, 1 Unknown, 0 Unchecked, 24.4s Time] [2024-11-22 18:28:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2024-11-22 18:28:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2526. [2024-11-22 18:28:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2379 states have (on average 1.273224043715847) internal successors, (3029), 2396 states have internal predecessors, (3029), 102 states have call successors, (102), 45 states have call predecessors, (102), 43 states have return successors, (111), 84 states have call predecessors, (111), 98 states have call successors, (111) [2024-11-22 18:28:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3242 transitions. [2024-11-22 18:28:33,740 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3242 transitions. Word has length 178 [2024-11-22 18:28:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:28:33,740 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3242 transitions. [2024-11-22 18:28:33,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 18:28:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3242 transitions. [2024-11-22 18:28:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-22 18:28:33,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:28:33,743 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:28:33,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-22 18:28:33,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:28:33,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:28:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:28:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1522585044, now seen corresponding path program 4 times [2024-11-22 18:28:33,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:28:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419464306] [2024-11-22 18:28:33,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:28:33,951 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-22 18:28:33,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:28:33,953 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:28:33,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:28:35,734 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:28:35,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:28:35,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:28:35,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:28:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-22 18:28:35,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:28:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-22 18:28:36,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:28:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419464306] [2024-11-22 18:28:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419464306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:28:36,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:28:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 18:28:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137446487] [2024-11-22 18:28:36,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:28:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:28:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:28:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:28:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:28:36,035 INFO L87 Difference]: Start difference. First operand 2526 states and 3242 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-22 18:28:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:28:36,254 INFO L93 Difference]: Finished difference Result 2556 states and 3257 transitions. [2024-11-22 18:28:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:28:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-22 18:28:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:28:36,261 INFO L225 Difference]: With dead ends: 2556 [2024-11-22 18:28:36,261 INFO L226 Difference]: Without dead ends: 2526 [2024-11-22 18:28:36,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:28:36,262 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 6 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:28:36,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1932 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:28:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2024-11-22 18:28:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2526. [2024-11-22 18:28:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2379 states have (on average 1.2585119798234552) internal successors, (2994), 2396 states have internal predecessors, (2994), 102 states have call successors, (102), 45 states have call predecessors, (102), 43 states have return successors, (111), 84 states have call predecessors, (111), 98 states have call successors, (111) [2024-11-22 18:28:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3207 transitions. [2024-11-22 18:28:36,286 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3207 transitions. Word has length 179 [2024-11-22 18:28:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:28:36,287 INFO L471 AbstractCegarLoop]: Abstraction has 2526 states and 3207 transitions. [2024-11-22 18:28:36,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-22 18:28:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3207 transitions. [2024-11-22 18:28:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-22 18:28:36,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:28:36,288 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:28:36,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-22 18:28:36,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:28:36,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:28:36,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:28:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 251784997, now seen corresponding path program 5 times [2024-11-22 18:28:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:28:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376843932] [2024-11-22 18:28:36,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 18:28:36,490 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-22 18:28:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:28:36,493 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:28:36,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-22 18:28:38,697 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-22 18:28:38,697 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:28:38,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 18:28:38,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:28:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-22 18:28:39,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:28:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-22 18:28:41,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:28:41,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376843932] [2024-11-22 18:28:41,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376843932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:28:41,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:28:41,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-22 18:28:41,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040734435] [2024-11-22 18:28:41,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:28:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-22 18:28:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:28:41,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-22 18:28:41,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-22 18:28:41,425 INFO L87 Difference]: Start difference. First operand 2526 states and 3207 transitions. Second operand has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 18:28:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:28:59,509 INFO L93 Difference]: Finished difference Result 2681 states and 3487 transitions. [2024-11-22 18:28:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-22 18:28:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 182 [2024-11-22 18:28:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:28:59,517 INFO L225 Difference]: With dead ends: 2681 [2024-11-22 18:28:59,517 INFO L226 Difference]: Without dead ends: 2681 [2024-11-22 18:28:59,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-22 18:28:59,520 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 27 mSDsluCounter, 8050 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8377 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:28:59,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8377 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 18:28:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2024-11-22 18:28:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2651. [2024-11-22 18:28:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2504 states have (on average 1.2955271565495208) internal successors, (3244), 2521 states have internal predecessors, (3244), 102 states have call successors, (102), 45 states have call predecessors, (102), 43 states have return successors, (111), 84 states have call predecessors, (111), 98 states have call successors, (111) [2024-11-22 18:28:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3457 transitions. [2024-11-22 18:28:59,548 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3457 transitions. Word has length 182 [2024-11-22 18:28:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:28:59,548 INFO L471 AbstractCegarLoop]: Abstraction has 2651 states and 3457 transitions. [2024-11-22 18:28:59,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 18:28:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3457 transitions. [2024-11-22 18:28:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-22 18:28:59,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:28:59,550 INFO L215 NwaCegarLoop]: trace histogram [96, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:28:59,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 18:28:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:28:59,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:28:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:28:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1658834268, now seen corresponding path program 6 times [2024-11-22 18:28:59,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:28:59,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381073853] [2024-11-22 18:28:59,752 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 18:28:59,752 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-22 18:28:59,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:28:59,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:28:59,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process