./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:25:28,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:25:28,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:25:28,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:25:28,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:25:28,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:25:28,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:25:28,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:25:28,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:25:28,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:25:28,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:25:28,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:25:28,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:25:28,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:25:28,727 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:25:28,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:25:28,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:25:28,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:25:28,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:25:28,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:25:28,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:25:28,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:25:28,733 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:25:28,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:25:28,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:25:28,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:25:28,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:25:28,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:25:28,735 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:25:28,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:25:28,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:25:28,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:25:28,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:25:28,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:25:28,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:25:28,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:25:28,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:28,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:25:28,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:25:28,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:25:28,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:25:28,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:25:28,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:25:28,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:25:28,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:25:28,739 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-14 17:25:29,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:25:29,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:25:29,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:25:29,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:25:29,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:25:29,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-10-14 17:25:30,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:25:30,859 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:25:30,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-10-14 17:25:30,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b34303d1/0441ab44f0bb45f5ac2dc6f6c214a2a0/FLAG5cfa64c6c [2024-10-14 17:25:30,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b34303d1/0441ab44f0bb45f5ac2dc6f6c214a2a0 [2024-10-14 17:25:30,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:25:30,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:25:30,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:30,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:25:30,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:25:30,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:30" (1/1) ... [2024-10-14 17:25:30,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fe9f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:30, skipping insertion in model container [2024-10-14 17:25:30,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:30" (1/1) ... [2024-10-14 17:25:30,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:31,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:31,519 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:25:31,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@71230e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:31, skipping insertion in model container [2024-10-14 17:25:31,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:31,521 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:25:31,524 INFO L158 Benchmark]: Toolchain (without parser) took 620.98ms. Allocated memory is still 157.3MB. Free memory was 103.6MB in the beginning and 84.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:25:31,524 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:25:31,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.86ms. Allocated memory is still 157.3MB. Free memory was 103.6MB in the beginning and 84.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:25:31,527 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.19ms. Allocated memory is still 96.5MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.86ms. Allocated memory is still 157.3MB. Free memory was 103.6MB in the beginning and 84.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:25:33,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:25:33,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:25:33,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:25:33,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:25:33,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:25:33,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:25:33,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:25:33,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:25:33,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:25:33,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:25:33,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:25:33,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:25:33,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:25:33,884 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:25:33,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:25:33,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:25:33,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:25:33,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:25:33,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:25:33,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:25:33,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:25:33,887 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:25:33,887 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:25:33,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:25:33,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:25:33,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:25:33,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:25:33,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:25:33,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:25:33,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:25:33,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:25:33,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:25:33,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:25:33,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:25:33,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:25:33,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:25:33,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:25:33,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:33,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:25:33,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:25:33,898 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:25:33,899 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:25:33,900 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-10-14 17:25:34,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:25:34,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:25:34,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:25:34,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:25:34,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:25:34,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-10-14 17:25:35,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:25:36,226 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:25:36,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test1-2.i [2024-10-14 17:25:36,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03214f789/5e6f612d024c48d0bb83c6df018cad06/FLAGe945c2911 [2024-10-14 17:25:36,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03214f789/5e6f612d024c48d0bb83c6df018cad06 [2024-10-14 17:25:36,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:25:36,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:25:36,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:36,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:25:36,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:25:36,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:36" (1/1) ... [2024-10-14 17:25:36,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280e5de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:36, skipping insertion in model container [2024-10-14 17:25:36,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:25:36" (1/1) ... [2024-10-14 17:25:36,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:37,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:37,069 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:25:37,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:25:37,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:37,186 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:25:37,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:25:37,321 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:25:37,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37 WrapperNode [2024-10-14 17:25:37,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:25:37,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:25:37,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:25:37,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:25:37,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,419 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 747 [2024-10-14 17:25:37,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:25:37,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:25:37,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:25:37,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:25:37,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,536 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-10-14 17:25:37,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:25:37,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:25:37,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:25:37,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:25:37,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (1/1) ... [2024-10-14 17:25:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:25:37,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:25:37,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:25:37,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:25:37,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:25:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:25:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:25:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:25:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:25:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:25:37,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:25:37,946 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:25:37,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:25:43,952 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-14 17:25:43,952 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:25:43,989 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:25:43,991 INFO L314 CfgBuilder]: Removed 40 assume(true) statements. [2024-10-14 17:25:43,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:25:43 BoogieIcfgContainer [2024-10-14 17:25:43,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:25:43,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:25:43,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:25:43,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:25:43,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:25:36" (1/3) ... [2024-10-14 17:25:43,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9d46c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:25:43, skipping insertion in model container [2024-10-14 17:25:43,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:25:37" (2/3) ... [2024-10-14 17:25:44,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9d46c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:25:43, skipping insertion in model container [2024-10-14 17:25:44,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:25:43" (3/3) ... [2024-10-14 17:25:44,004 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test1-2.i [2024-10-14 17:25:44,021 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:25:44,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:25:44,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:25:44,080 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;@1be870dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:25:44,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:25:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 128 states have (on average 1.6640625) internal successors, (213), 130 states have internal predecessors, (213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:25:44,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:44,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:44,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:44,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:44,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1248919104, now seen corresponding path program 1 times [2024-10-14 17:25:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:44,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099018228] [2024-10-14 17:25:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:44,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:44,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:44,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:44,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:25:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:44,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:25:44,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:44,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:44,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099018228] [2024-10-14 17:25:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099018228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:44,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:25:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275162667] [2024-10-14 17:25:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:44,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:25:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:25:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:25:44,311 INFO L87 Difference]: Start difference. First operand has 135 states, 128 states have (on average 1.6640625) internal successors, (213), 130 states have internal predecessors, (213), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:44,368 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2024-10-14 17:25:44,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:25:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:25:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:44,381 INFO L225 Difference]: With dead ends: 134 [2024-10-14 17:25:44,383 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 17:25:44,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:25:44,390 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:44,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:25:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 17:25:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-14 17:25:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 128 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2024-10-14 17:25:44,435 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 8 [2024-10-14 17:25:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:44,435 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2024-10-14 17:25:44,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2024-10-14 17:25:44,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:25:44,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:44,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:44,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 17:25:44,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:44,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:44,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2111714382, now seen corresponding path program 1 times [2024-10-14 17:25:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747502635] [2024-10-14 17:25:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:44,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:44,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:44,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:25:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:44,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:25:44,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:44,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:44,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747502635] [2024-10-14 17:25:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747502635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:44,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:44,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:25:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521283379] [2024-10-14 17:25:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:44,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:25:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:25:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:44,781 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:45,122 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2024-10-14 17:25:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:25:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:25:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:45,125 INFO L225 Difference]: With dead ends: 222 [2024-10-14 17:25:45,131 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 17:25:45,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:45,133 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 108 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:45,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:25:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 17:25:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 134. [2024-10-14 17:25:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 128 states have (on average 1.296875) internal successors, (166), 129 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2024-10-14 17:25:45,160 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 8 [2024-10-14 17:25:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:45,161 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2024-10-14 17:25:45,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2024-10-14 17:25:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 17:25:45,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:45,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:45,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:25:45,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:45,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:45,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1240403089, now seen corresponding path program 1 times [2024-10-14 17:25:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325959484] [2024-10-14 17:25:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:45,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:45,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:45,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:45,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:25:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:45,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:45,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:45,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:45,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325959484] [2024-10-14 17:25:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325959484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27035797] [2024-10-14 17:25:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:45,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:45,798 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:46,051 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2024-10-14 17:25:46,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:25:46,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 17:25:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:46,056 INFO L225 Difference]: With dead ends: 137 [2024-10-14 17:25:46,056 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 17:25:46,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:46,058 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 30 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:46,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 394 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:25:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 17:25:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-14 17:25:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.2290076335877862) internal successors, (161), 132 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 167 transitions. [2024-10-14 17:25:46,073 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 167 transitions. Word has length 63 [2024-10-14 17:25:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 167 transitions. [2024-10-14 17:25:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 167 transitions. [2024-10-14 17:25:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 17:25:46,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:46,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:46,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:25:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:46,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -994254075, now seen corresponding path program 1 times [2024-10-14 17:25:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:46,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045684686] [2024-10-14 17:25:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:46,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:46,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:25:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:46,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:25:46,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:46,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:46,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045684686] [2024-10-14 17:25:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045684686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:25:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495973402] [2024-10-14 17:25:46,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:46,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:25:46,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:46,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:25:46,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:46,840 INFO L87 Difference]: Start difference. First operand 137 states and 167 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:47,016 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2024-10-14 17:25:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:25:47,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 17:25:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:47,018 INFO L225 Difference]: With dead ends: 131 [2024-10-14 17:25:47,018 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 17:25:47,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:25:47,020 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:47,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:25:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 17:25:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-14 17:25:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 125 states have (on average 1.208) internal successors, (151), 126 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2024-10-14 17:25:47,034 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 63 [2024-10-14 17:25:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:47,034 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2024-10-14 17:25:47,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2024-10-14 17:25:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 17:25:47,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:47,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:47,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:25:47,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:47,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:47,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1249729223, now seen corresponding path program 1 times [2024-10-14 17:25:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456968789] [2024-10-14 17:25:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:47,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:47,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:47,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:47,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:25:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:47,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:47,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:48,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:48,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:48,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456968789] [2024-10-14 17:25:48,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456968789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:48,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:48,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:25:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386209457] [2024-10-14 17:25:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:48,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:25:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:48,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:25:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:48,036 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:49,298 INFO L93 Difference]: Finished difference Result 197 states and 232 transitions. [2024-10-14 17:25:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:25:49,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 17:25:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:49,306 INFO L225 Difference]: With dead ends: 197 [2024-10-14 17:25:49,306 INFO L226 Difference]: Without dead ends: 197 [2024-10-14 17:25:49,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:25:49,307 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 37 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:49,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 308 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 17:25:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-14 17:25:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 167. [2024-10-14 17:25:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 161 states have (on average 1.1614906832298137) internal successors, (187), 162 states have internal predecessors, (187), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 17:25:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2024-10-14 17:25:49,314 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 63 [2024-10-14 17:25:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:49,314 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2024-10-14 17:25:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:25:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2024-10-14 17:25:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 17:25:49,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:49,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:49,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 17:25:49,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:49,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:49,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:49,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1785499086, now seen corresponding path program 1 times [2024-10-14 17:25:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317920186] [2024-10-14 17:25:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:49,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:49,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:49,527 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:25:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:49,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:25:49,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:25:50,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:50,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317920186] [2024-10-14 17:25:50,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317920186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:50,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:50,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:50,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164575383] [2024-10-14 17:25:50,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:50,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:50,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:50,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:50,013 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:25:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:50,094 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2024-10-14 17:25:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:25:50,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2024-10-14 17:25:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:50,097 INFO L225 Difference]: With dead ends: 169 [2024-10-14 17:25:50,098 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 17:25:50,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:50,099 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:50,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:25:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 17:25:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-14 17:25:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 162 states have (on average 1.1666666666666667) internal successors, (189), 164 states have internal predecessors, (189), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:25:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2024-10-14 17:25:50,111 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 76 [2024-10-14 17:25:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:50,112 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2024-10-14 17:25:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:25:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2024-10-14 17:25:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 17:25:50,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:50,115 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:50,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:25:50,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:50,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1231813386, now seen corresponding path program 1 times [2024-10-14 17:25:50,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939666241] [2024-10-14 17:25:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:25:50,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:50,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:50,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:50,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:25:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:25:50,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:25:50,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:25:50,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:25:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:25:50,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939666241] [2024-10-14 17:25:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939666241] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:25:50,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:25:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:25:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264403382] [2024-10-14 17:25:50,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:25:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:25:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:25:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:25:50,883 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:51,145 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2024-10-14 17:25:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:25:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2024-10-14 17:25:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:51,147 INFO L225 Difference]: With dead ends: 178 [2024-10-14 17:25:51,147 INFO L226 Difference]: Without dead ends: 178 [2024-10-14 17:25:51,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:25:51,149 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:51,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 738 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:25:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-14 17:25:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2024-10-14 17:25:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 169 states have (on average 1.1952662721893492) internal successors, (202), 171 states have internal predecessors, (202), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:25:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 209 transitions. [2024-10-14 17:25:51,156 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 209 transitions. Word has length 78 [2024-10-14 17:25:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:51,157 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 209 transitions. [2024-10-14 17:25:51,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 209 transitions. [2024-10-14 17:25:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 17:25:51,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:51,163 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:25:51,176 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-10-14 17:25:51,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:51,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:51,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2071635278, now seen corresponding path program 2 times [2024-10-14 17:25:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090246500] [2024-10-14 17:25:51,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:25:51,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:51,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:51,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:25:51,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:25:51,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:25:51,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:25:51,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:25:51,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:25:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:25:52,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:52,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090246500] [2024-10-14 17:25:52,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090246500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:25:52,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:25:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:25:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298250795] [2024-10-14 17:25:52,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:25:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:25:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:25:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:25:52,143 INFO L87 Difference]: Start difference. First operand 177 states and 209 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:25:53,016 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2024-10-14 17:25:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:25:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-14 17:25:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:25:53,019 INFO L225 Difference]: With dead ends: 189 [2024-10-14 17:25:53,019 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 17:25:53,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 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-10-14 17:25:53,020 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 7 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:25:53,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1034 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:25:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 17:25:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-10-14 17:25:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 178 states have (on average 1.202247191011236) internal successors, (214), 180 states have internal predecessors, (214), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:25:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 221 transitions. [2024-10-14 17:25:53,037 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 221 transitions. Word has length 82 [2024-10-14 17:25:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:25:53,037 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 221 transitions. [2024-10-14 17:25:53,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 14 states have internal predecessors, (86), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:25:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2024-10-14 17:25:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 17:25:53,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:25:53,040 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-14 17:25:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:25:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:53,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:25:53,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:25:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash 574315950, now seen corresponding path program 3 times [2024-10-14 17:25:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:25:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057395736] [2024-10-14 17:25:53,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:25:53,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:25:53,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:25:53,245 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:25:53,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:25:53,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:25:53,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:25:53,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:25:53,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:25:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 17:25:53,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:25:53,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:25:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057395736] [2024-10-14 17:25:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057395736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:25:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:25:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:25:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820145473] [2024-10-14 17:25:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:25:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:25:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:25:53,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:25:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:25:53,901 INFO L87 Difference]: Start difference. First operand 186 states and 221 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:25:58,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:26:02,635 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-10-14 17:26:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:04,504 INFO L93 Difference]: Finished difference Result 257 states and 311 transitions. [2024-10-14 17:26:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:26:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-10-14 17:26:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:04,508 INFO L225 Difference]: With dead ends: 257 [2024-10-14 17:26:04,508 INFO L226 Difference]: Without dead ends: 257 [2024-10-14 17:26:04,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:26:04,509 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 251 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:04,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 289 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-10-14 17:26:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-14 17:26:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 188. [2024-10-14 17:26:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 182 states have internal predecessors, (214), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:26:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 221 transitions. [2024-10-14 17:26:04,516 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 221 transitions. Word has length 91 [2024-10-14 17:26:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:04,516 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 221 transitions. [2024-10-14 17:26:04,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:26:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 221 transitions. [2024-10-14 17:26:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 17:26:04,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:04,518 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-14 17:26:04,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:26:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:04,718 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1073915072, now seen corresponding path program 1 times [2024-10-14 17:26:04,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389157105] [2024-10-14 17:26:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:26:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:04,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:04,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:04,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:26:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:26:05,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:26:05,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:26:05,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 17:26:06,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:06,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389157105] [2024-10-14 17:26:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389157105] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:06,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:26:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577157622] [2024-10-14 17:26:06,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:06,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:26:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:26:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:26:06,288 INFO L87 Difference]: Start difference. First operand 188 states and 221 transitions. Second operand has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:08,714 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2024-10-14 17:26:08,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:26:08,716 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2024-10-14 17:26:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:08,717 INFO L225 Difference]: With dead ends: 209 [2024-10-14 17:26:08,717 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 17:26:08,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:26:08,722 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 13 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:08,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1903 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 17:26:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 17:26:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2024-10-14 17:26:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 198 states have (on average 1.202020202020202) internal successors, (238), 200 states have internal predecessors, (238), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:26:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2024-10-14 17:26:08,729 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 92 [2024-10-14 17:26:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2024-10-14 17:26:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2024-10-14 17:26:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 17:26:08,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:08,738 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-14 17:26:08,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:26:08,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:08,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:08,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1348862400, now seen corresponding path program 2 times [2024-10-14 17:26:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810043523] [2024-10-14 17:26:08,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:26:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:08,941 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:08,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:26:09,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:26:09,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:09,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:26:09,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:26:10,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 17:26:11,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:11,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810043523] [2024-10-14 17:26:11,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810043523] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:11,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:26:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726355233] [2024-10-14 17:26:11,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:11,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:26:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:26:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:26:12,000 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:21,360 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2024-10-14 17:26:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:26:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-10-14 17:26:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:21,362 INFO L225 Difference]: With dead ends: 243 [2024-10-14 17:26:21,362 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 17:26:21,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:26:21,365 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 25 mSDsluCounter, 3795 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:21,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3944 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 17:26:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 17:26:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2024-10-14 17:26:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 232 states have (on average 1.2241379310344827) internal successors, (284), 234 states have internal predecessors, (284), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 17:26:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2024-10-14 17:26:21,370 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 110 [2024-10-14 17:26:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:21,371 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2024-10-14 17:26:21,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2024-10-14 17:26:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 17:26:21,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:21,373 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-14 17:26:21,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 17:26:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:21,574 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:21,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1950106432, now seen corresponding path program 3 times [2024-10-14 17:26:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:21,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691744081] [2024-10-14 17:26:21,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:26:21,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:21,576 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:21,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 17:26:22,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:26:22,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:22,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:26:22,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-10-14 17:26:22,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-10-14 17:26:22,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:22,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691744081] [2024-10-14 17:26:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691744081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:22,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 17:26:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406048455] [2024-10-14 17:26:22,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:22,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:26:22,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:22,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:26:22,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:26:22,595 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:23,036 INFO L93 Difference]: Finished difference Result 433 states and 520 transitions. [2024-10-14 17:26:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:26:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2024-10-14 17:26:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:23,040 INFO L225 Difference]: With dead ends: 433 [2024-10-14 17:26:23,040 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 17:26:23,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:26:23,041 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 397 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:23,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 674 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:26:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 17:26:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-10-14 17:26:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 422 states have (on average 1.1943127962085307) internal successors, (504), 424 states have internal predecessors, (504), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 17:26:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 520 transitions. [2024-10-14 17:26:23,051 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 520 transitions. Word has length 144 [2024-10-14 17:26:23,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:23,052 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 520 transitions. [2024-10-14 17:26:23,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:26:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 520 transitions. [2024-10-14 17:26:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-14 17:26:23,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:23,059 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:23,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 17:26:23,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:23,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -611278841, now seen corresponding path program 1 times [2024-10-14 17:26:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041056842] [2024-10-14 17:26:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:26:23,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:23,265 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:23,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:26:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:26:24,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:26:24,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-14 17:26:25,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-14 17:26:28,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041056842] [2024-10-14 17:26:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041056842] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:28,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:26:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152297654] [2024-10-14 17:26:28,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:28,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:26:28,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:28,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:26:28,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:26:28,498 INFO L87 Difference]: Start difference. First operand 433 states and 520 transitions. Second operand has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:26:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:26:38,412 INFO L93 Difference]: Finished difference Result 460 states and 578 transitions. [2024-10-14 17:26:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:26:38,413 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 309 [2024-10-14 17:26:38,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:26:38,415 INFO L225 Difference]: With dead ends: 460 [2024-10-14 17:26:38,415 INFO L226 Difference]: Without dead ends: 460 [2024-10-14 17:26:38,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:26:38,418 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 26 mSDsluCounter, 3774 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:26:38,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3922 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 17:26:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-14 17:26:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2024-10-14 17:26:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 447 states have (on average 1.2393736017897092) internal successors, (554), 449 states have internal predecessors, (554), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 17:26:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 570 transitions. [2024-10-14 17:26:38,430 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 570 transitions. Word has length 309 [2024-10-14 17:26:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:26:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 570 transitions. [2024-10-14 17:26:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:26:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 570 transitions. [2024-10-14 17:26:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-14 17:26:38,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:26:38,434 INFO L215 NwaCegarLoop]: trace histogram [92, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:26:38,466 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 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:26:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:38,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:26:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:26:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1062346891, now seen corresponding path program 2 times [2024-10-14 17:26:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:26:38,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170082384] [2024-10-14 17:26:38,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:26:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:26:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:26:38,640 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:26:38,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:26:40,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:26:40,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:26:40,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:26:40,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:26:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-14 17:26:42,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:26:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4702 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-10-14 17:26:49,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:26:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170082384] [2024-10-14 17:26:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170082384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:26:49,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:26:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:26:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500922808] [2024-10-14 17:26:49,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:26:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:26:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:26:49,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:26:49,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:26:49,716 INFO L87 Difference]: Start difference. First operand 458 states and 570 transitions. Second operand has 102 states, 100 states have (on average 2.11) internal successors, (211), 102 states have internal predecessors, (211), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)