./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:56:16,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:56:16,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:56:16,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:56:16,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:56:16,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:56:16,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:56:16,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:56:16,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:56:16,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:56:16,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:56:16,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:56:16,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:56:16,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:56:16,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:56:16,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:56:16,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:56:16,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:56:16,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:56:16,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:56:16,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:56:16,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:56:16,766 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:56:16,766 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:56:16,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:56:16,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:56:16,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:56:16,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:56:16,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:56:16,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:56:16,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:56:16,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:56:16,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:56:16,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:56:16,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:56:16,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:56:16,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:56:16,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:56:16,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:56:16,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:56:16,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:56:16,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:56:16,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:56:16,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:56:16,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:56:16,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-10 14:56:17,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:56:17,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:56:17,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:56:17,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:56:17,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:56:17,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-10 14:56:18,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:56:18,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:56:18,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-10 14:56:18,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5e96fe7/23458909ce7d48179e208d6d3cb4de3f/FLAG6bace7170 [2024-11-10 14:56:18,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5e96fe7/23458909ce7d48179e208d6d3cb4de3f [2024-11-10 14:56:18,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:56:18,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:56:18,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:56:18,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:56:18,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:56:18,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:18" (1/1) ... [2024-11-10 14:56:18,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dd96ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:18, skipping insertion in model container [2024-11-10 14:56:18,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:18" (1/1) ... [2024-11-10 14:56:18,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:56:19,305 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,355 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,361 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,365 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,380 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,421 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,426 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,431 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,438 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,452 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,454 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,455 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,460 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,461 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,461 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,465 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,466 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,466 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,467 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,469 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:19,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:56:19,501 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 14:56:19,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1cc0def7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:19, skipping insertion in model container [2024-11-10 14:56:19,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:56:19,503 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:56:19,505 INFO L158 Benchmark]: Toolchain (without parser) took 684.09ms. Allocated memory is still 169.9MB. Free memory was 97.8MB in the beginning and 117.2MB in the end (delta: -19.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-10 14:56:19,505 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 169.9MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:56:19,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 679.02ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 117.2MB in the end (delta: -19.7MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-10 14:56:19,507 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.24ms. Allocated memory is still 169.9MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 679.02ms. Allocated memory is still 169.9MB. Free memory was 97.5MB in the beginning and 117.2MB in the end (delta: -19.7MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:56:21,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:56:21,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:56:21,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:56:21,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:56:21,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:56:21,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:56:21,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:56:21,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:56:21,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:56:21,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:56:21,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:56:21,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:56:21,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:56:21,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:56:21,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:56:21,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:56:21,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:56:21,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:56:21,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:56:21,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:56:21,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:56:21,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:56:21,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:56:21,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:56:21,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:56:21,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:56:21,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:56:21,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:56:21,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:56:21,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:56:21,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:56:21,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:56:21,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:56:21,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:56:21,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:56:21,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:56:21,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:56:21,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:56:21,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:56:21,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:56:21,639 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:56:21,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:56:21,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:56:21,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:56:21,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:56:21,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:56:21,640 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-10 14:56:21,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:56:22,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:56:22,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:56:22,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:56:22,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:56:22,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-10 14:56:23,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:56:23,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:56:23,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2024-11-10 14:56:23,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2036aa120/cd697dedb1b847b5b7818defbe1f743d/FLAG063a9c834 [2024-11-10 14:56:23,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2036aa120/cd697dedb1b847b5b7818defbe1f743d [2024-11-10 14:56:23,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:56:23,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:56:23,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:56:23,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:56:23,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:56:23,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:23" (1/1) ... [2024-11-10 14:56:23,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489e3005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:23, skipping insertion in model container [2024-11-10 14:56:23,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:56:23" (1/1) ... [2024-11-10 14:56:24,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:56:24,471 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,512 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,517 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,523 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,533 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,569 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,571 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,573 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,578 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,588 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,589 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,591 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,596 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,597 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,598 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,602 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,607 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,608 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,608 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,613 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:56:24,646 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:56:24,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:56:24,685 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,727 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,734 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,736 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,739 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,762 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,764 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,765 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,768 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,776 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,777 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,778 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,782 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,783 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,783 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,785 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,786 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,791 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,793 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,796 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:56:24,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:56:24,803 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:56:24,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:56:24,935 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:56:24,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24 WrapperNode [2024-11-10 14:56:24,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:56:24,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:56:24,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:56:24,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:56:24,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:24,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,083 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1388 [2024-11-10 14:56:25,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:56:25,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:56:25,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:56:25,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:56:25,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,238 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-10 14:56:25,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:56:25,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:56:25,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:56:25,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:56:25,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (1/1) ... [2024-11-10 14:56:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:56:25,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:56:25,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:56:25,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 14:56:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 14:56:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 14:56:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 14:56:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:56:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:56:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:56:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:56:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:56:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:56:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:56:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:56:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:56:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:56:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:56:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:56:25,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:56:25,742 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:56:25,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:56:39,090 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2024-11-10 14:56:39,090 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:56:39,116 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:56:39,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:56:39,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:56:39 BoogieIcfgContainer [2024-11-10 14:56:39,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:56:39,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:56:39,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:56:39,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:56:39,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:56:23" (1/3) ... [2024-11-10 14:56:39,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d590269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:39, skipping insertion in model container [2024-11-10 14:56:39,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:56:24" (2/3) ... [2024-11-10 14:56:39,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d590269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:56:39, skipping insertion in model container [2024-11-10 14:56:39,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:56:39" (3/3) ... [2024-11-10 14:56:39,126 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-3.i [2024-11-10 14:56:39,144 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:56:39,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:56:39,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:56:39,217 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;@698da1d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:56:39,218 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:56:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 248 states have (on average 1.6370967741935485) internal successors, (406), 250 states have internal predecessors, (406), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 14:56:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 14:56:39,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:56:39,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 14:56:39,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:56:39,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:56:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash 444658895, now seen corresponding path program 1 times [2024-11-10 14:56:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:56:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896707281] [2024-11-10 14:56:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:56:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:56:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:56:39,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:56:39,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 14:56:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:56:39,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:56:39,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:56:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:56:39,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:56:39,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:56:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896707281] [2024-11-10 14:56:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896707281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:56:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:56:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:56:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75314912] [2024-11-10 14:56:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:56:39,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:56:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:56:39,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:56:39,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:56:39,551 INFO L87 Difference]: Start difference. First operand has 258 states, 248 states have (on average 1.6370967741935485) internal successors, (406), 250 states have internal predecessors, (406), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:56:43,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:56:47,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:56:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:56:48,428 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2024-11-10 14:56:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:56:48,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 14:56:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:56:48,452 INFO L225 Difference]: With dead ends: 324 [2024-11-10 14:56:48,454 INFO L226 Difference]: Without dead ends: 318 [2024-11-10 14:56:48,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:56:48,460 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 84 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-10 14:56:48,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 671 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-10 14:56:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-10 14:56:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 268. [2024-11-10 14:56:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 259 states have (on average 1.2895752895752897) internal successors, (334), 260 states have internal predecessors, (334), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 14:56:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 346 transitions. [2024-11-10 14:56:48,528 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 346 transitions. Word has length 5 [2024-11-10 14:56:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:56:48,528 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 346 transitions. [2024-11-10 14:56:48,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:56:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 346 transitions. [2024-11-10 14:56:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 14:56:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:56:48,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:56:48,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 14:56:48,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:56:48,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:56:48,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:56:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -447774620, now seen corresponding path program 1 times [2024-11-10 14:56:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:56:48,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113432135] [2024-11-10 14:56:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:56:48,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:56:48,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:56:48,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:56:48,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 14:56:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:56:48,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:56:48,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:56:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:56:49,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:56:49,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:56:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113432135] [2024-11-10 14:56:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113432135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:56:49,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:56:49,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:56:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958834821] [2024-11-10 14:56:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:56:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:56:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:56:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:56:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:56:49,010 INFO L87 Difference]: Start difference. First operand 268 states and 346 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:56:53,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:56:54,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:56:58,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:57:05,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:57:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:06,194 INFO L93 Difference]: Finished difference Result 391 states and 504 transitions. [2024-11-10 14:57:06,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:57:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-10 14:57:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:06,200 INFO L225 Difference]: With dead ends: 391 [2024-11-10 14:57:06,200 INFO L226 Difference]: Without dead ends: 391 [2024-11-10 14:57:06,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:57:06,201 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 159 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:06,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 901 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 17.2s Time] [2024-11-10 14:57:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-10 14:57:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-10 14:57:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 380 states have internal predecessors, (486), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:57:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 504 transitions. [2024-11-10 14:57:06,235 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 504 transitions. Word has length 13 [2024-11-10 14:57:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:06,235 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 504 transitions. [2024-11-10 14:57:06,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:57:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 504 transitions. [2024-11-10 14:57:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 14:57:06,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:06,237 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:06,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:57:06,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:06,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash 547099607, now seen corresponding path program 1 times [2024-11-10 14:57:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499957945] [2024-11-10 14:57:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:06,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:06,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:06,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:06,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 14:57:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:06,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:57:06,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:57:06,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:57:06,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:06,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499957945] [2024-11-10 14:57:06,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499957945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:57:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:57:06,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:57:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857463477] [2024-11-10 14:57:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:57:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:57:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:57:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:57:06,727 INFO L87 Difference]: Start difference. First operand 391 states and 504 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:57:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:07,192 INFO L93 Difference]: Finished difference Result 444 states and 572 transitions. [2024-11-10 14:57:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:57:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 31 [2024-11-10 14:57:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:07,198 INFO L225 Difference]: With dead ends: 444 [2024-11-10 14:57:07,198 INFO L226 Difference]: Without dead ends: 444 [2024-11-10 14:57:07,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:57:07,199 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 123 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:07,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 620 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 14:57:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-10 14:57:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 389. [2024-11-10 14:57:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 378 states have internal predecessors, (482), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:57:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 500 transitions. [2024-11-10 14:57:07,212 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 500 transitions. Word has length 31 [2024-11-10 14:57:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:07,212 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 500 transitions. [2024-11-10 14:57:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:57:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 500 transitions. [2024-11-10 14:57:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 14:57:07,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:07,214 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:07,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 14:57:07,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:07,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:07,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1490956682, now seen corresponding path program 1 times [2024-11-10 14:57:07,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:07,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611278180] [2024-11-10 14:57:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:07,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 14:57:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:07,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:57:07,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:57:07,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:57:07,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611278180] [2024-11-10 14:57:07,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611278180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:57:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:57:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:57:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166319437] [2024-11-10 14:57:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:57:07,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:57:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:57:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:57:07,728 INFO L87 Difference]: Start difference. First operand 389 states and 500 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:57:11,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:57:16,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:57:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:18,468 INFO L93 Difference]: Finished difference Result 444 states and 571 transitions. [2024-11-10 14:57:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:57:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-11-10 14:57:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:18,472 INFO L225 Difference]: With dead ends: 444 [2024-11-10 14:57:18,472 INFO L226 Difference]: Without dead ends: 436 [2024-11-10 14:57:18,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:57:18,473 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 126 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:18,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 938 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2024-11-10 14:57:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-10 14:57:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 381. [2024-11-10 14:57:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 369 states have (on average 1.2818428184281843) internal successors, (473), 370 states have internal predecessors, (473), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:57:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 491 transitions. [2024-11-10 14:57:18,485 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 491 transitions. Word has length 31 [2024-11-10 14:57:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:18,485 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 491 transitions. [2024-11-10 14:57:18,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:57:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 491 transitions. [2024-11-10 14:57:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 14:57:18,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:18,490 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:18,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:57:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:18,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1176188691, now seen corresponding path program 1 times [2024-11-10 14:57:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840183640] [2024-11-10 14:57:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:18,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:18,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:18,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 14:57:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:19,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:57:19,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 14:57:19,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:57:19,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840183640] [2024-11-10 14:57:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840183640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:57:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:57:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:57:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991293946] [2024-11-10 14:57:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:57:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:57:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:57:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:57:19,433 INFO L87 Difference]: Start difference. First operand 381 states and 491 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 14:57:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:19,519 INFO L93 Difference]: Finished difference Result 387 states and 481 transitions. [2024-11-10 14:57:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:57:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 152 [2024-11-10 14:57:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:19,521 INFO L225 Difference]: With dead ends: 387 [2024-11-10 14:57:19,521 INFO L226 Difference]: Without dead ends: 387 [2024-11-10 14:57:19,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:57:19,522 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 30 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:19,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 871 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:57:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-10 14:57:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-10 14:57:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 375 states have (on average 1.2346666666666666) internal successors, (463), 376 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 14:57:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 481 transitions. [2024-11-10 14:57:19,531 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 481 transitions. Word has length 152 [2024-11-10 14:57:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:19,531 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 481 transitions. [2024-11-10 14:57:19,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 14:57:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 481 transitions. [2024-11-10 14:57:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 14:57:19,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:19,534 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:19,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 14:57:19,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:19,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:19,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1695658151, now seen corresponding path program 1 times [2024-11-10 14:57:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966336416] [2024-11-10 14:57:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:19,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:19,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:19,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:19,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 14:57:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:20,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:57:20,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:57:20,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:57:20,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966336416] [2024-11-10 14:57:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966336416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:57:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:57:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:57:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568916975] [2024-11-10 14:57:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:57:20,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:57:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:57:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:57:20,457 INFO L87 Difference]: Start difference. First operand 387 states and 481 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:57:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:20,510 INFO L93 Difference]: Finished difference Result 390 states and 487 transitions. [2024-11-10 14:57:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:57:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152 [2024-11-10 14:57:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:20,514 INFO L225 Difference]: With dead ends: 390 [2024-11-10 14:57:20,514 INFO L226 Difference]: Without dead ends: 390 [2024-11-10 14:57:20,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:57:20,515 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:20,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 929 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:57:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-10 14:57:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-10 14:57:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 377 states have (on average 1.2360742705570291) internal successors, (466), 379 states have internal predecessors, (466), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 487 transitions. [2024-11-10 14:57:20,529 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 487 transitions. Word has length 152 [2024-11-10 14:57:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:20,530 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 487 transitions. [2024-11-10 14:57:20,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:57:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 487 transitions. [2024-11-10 14:57:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 14:57:20,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:20,532 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:20,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 14:57:20,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:20,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -96915751, now seen corresponding path program 1 times [2024-11-10 14:57:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:20,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424465094] [2024-11-10 14:57:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:20,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:20,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:20,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:20,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 14:57:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:21,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:57:21,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 14:57:21,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-10 14:57:21,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424465094] [2024-11-10 14:57:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424465094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:21,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 14:57:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977620157] [2024-11-10 14:57:21,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:57:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:57:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:57:21,523 INFO L87 Difference]: Start difference. First operand 390 states and 487 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:21,717 INFO L93 Difference]: Finished difference Result 401 states and 505 transitions. [2024-11-10 14:57:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:57:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 156 [2024-11-10 14:57:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:21,721 INFO L225 Difference]: With dead ends: 401 [2024-11-10 14:57:21,721 INFO L226 Difference]: Without dead ends: 401 [2024-11-10 14:57:21,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:57:21,722 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 5 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:21,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1234 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:57:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-10 14:57:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2024-11-10 14:57:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 385 states have (on average 1.2467532467532467) internal successors, (480), 387 states have internal predecessors, (480), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2024-11-10 14:57:21,738 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 156 [2024-11-10 14:57:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2024-11-10 14:57:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2024-11-10 14:57:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 14:57:21,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:21,740 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:21,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 14:57:21,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:21,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2106239961, now seen corresponding path program 2 times [2024-11-10 14:57:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109736162] [2024-11-10 14:57:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:57:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:21,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:21,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 14:57:22,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:57:22,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:57:22,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:57:22,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 14:57:22,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-10 14:57:22,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:22,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109736162] [2024-11-10 14:57:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109736162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:22,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 14:57:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41089829] [2024-11-10 14:57:22,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:57:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:57:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:57:22,949 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:23,484 INFO L93 Difference]: Finished difference Result 414 states and 525 transitions. [2024-11-10 14:57:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 14:57:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2024-11-10 14:57:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:23,488 INFO L225 Difference]: With dead ends: 414 [2024-11-10 14:57:23,488 INFO L226 Difference]: Without dead ends: 410 [2024-11-10 14:57:23,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:57:23,489 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 8 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:23,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1854 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:57:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-10 14:57:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2024-11-10 14:57:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 394 states have (on average 1.248730964467005) internal successors, (492), 396 states have internal predecessors, (492), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 513 transitions. [2024-11-10 14:57:23,502 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 513 transitions. Word has length 164 [2024-11-10 14:57:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:23,503 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 513 transitions. [2024-11-10 14:57:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 513 transitions. [2024-11-10 14:57:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 14:57:23,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:23,505 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:23,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 14:57:23,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:23,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:23,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1806490741, now seen corresponding path program 3 times [2024-11-10 14:57:23,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:23,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845391946] [2024-11-10 14:57:23,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:57:23,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:23,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:23,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 14:57:25,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-10 14:57:25,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:57:25,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 14:57:25,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 176 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-10 14:57:25,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 176 proven. 15 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-10 14:57:25,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:25,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845391946] [2024-11-10 14:57:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845391946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:25,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 14:57:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654849393] [2024-11-10 14:57:25,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 14:57:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 14:57:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-10 14:57:25,468 INFO L87 Difference]: Start difference. First operand 408 states and 513 transitions. Second operand has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 14:57:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:26,078 INFO L93 Difference]: Finished difference Result 419 states and 532 transitions. [2024-11-10 14:57:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 14:57:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 182 [2024-11-10 14:57:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:26,081 INFO L225 Difference]: With dead ends: 419 [2024-11-10 14:57:26,082 INFO L226 Difference]: Without dead ends: 417 [2024-11-10 14:57:26,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-10 14:57:26,083 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 9 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:26,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:57:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-10 14:57:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2024-11-10 14:57:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 401 states have (on average 1.259351620947631) internal successors, (505), 403 states have internal predecessors, (505), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 526 transitions. [2024-11-10 14:57:26,094 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 526 transitions. Word has length 182 [2024-11-10 14:57:26,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:26,094 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 526 transitions. [2024-11-10 14:57:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5) internal successors, (152), 16 states have internal predecessors, (152), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-10 14:57:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 526 transitions. [2024-11-10 14:57:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 14:57:26,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:26,097 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:26,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 14:57:26,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:26,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -270272551, now seen corresponding path program 4 times [2024-11-10 14:57:26,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:26,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692825268] [2024-11-10 14:57:26,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 14:57:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:26,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:26,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 14:57:26,900 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 14:57:26,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:57:26,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:57:26,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-10 14:57:26,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:57:26,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692825268] [2024-11-10 14:57:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692825268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:57:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:57:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:57:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79332513] [2024-11-10 14:57:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:57:26,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:57:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:26,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:57:26,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:57:26,978 INFO L87 Difference]: Start difference. First operand 415 states and 526 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:57:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:27,074 INFO L93 Difference]: Finished difference Result 455 states and 566 transitions. [2024-11-10 14:57:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:57:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2024-11-10 14:57:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:27,076 INFO L225 Difference]: With dead ends: 455 [2024-11-10 14:57:27,076 INFO L226 Difference]: Without dead ends: 455 [2024-11-10 14:57:27,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:57:27,076 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:27,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:57:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-10 14:57:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-10 14:57:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 441 states have (on average 1.2358276643990929) internal successors, (545), 443 states have internal predecessors, (545), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 566 transitions. [2024-11-10 14:57:27,088 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 566 transitions. Word has length 196 [2024-11-10 14:57:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:27,089 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 566 transitions. [2024-11-10 14:57:27,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:57:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 566 transitions. [2024-11-10 14:57:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 14:57:27,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:27,091 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:27,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 14:57:27,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:27,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash -713883974, now seen corresponding path program 1 times [2024-11-10 14:57:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248327004] [2024-11-10 14:57:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:57:27,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:27,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:27,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:27,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 14:57:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:57:28,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 14:57:28,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 418 proven. 55 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-11-10 14:57:28,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 2 proven. 468 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-10 14:57:28,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248327004] [2024-11-10 14:57:28,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248327004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:28,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 14:57:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024496437] [2024-11-10 14:57:28,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:57:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:57:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:57:28,806 INFO L87 Difference]: Start difference. First operand 455 states and 566 transitions. Second operand has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:30,393 INFO L93 Difference]: Finished difference Result 473 states and 596 transitions. [2024-11-10 14:57:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 14:57:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 196 [2024-11-10 14:57:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:30,397 INFO L225 Difference]: With dead ends: 473 [2024-11-10 14:57:30,397 INFO L226 Difference]: Without dead ends: 469 [2024-11-10 14:57:30,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 14:57:30,399 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 13 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:30,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4309 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 14:57:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-10 14:57:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2024-11-10 14:57:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 453 states have (on average 1.229580573951435) internal successors, (557), 455 states have internal predecessors, (557), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 578 transitions. [2024-11-10 14:57:30,409 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 578 transitions. Word has length 196 [2024-11-10 14:57:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:30,409 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 578 transitions. [2024-11-10 14:57:30,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 26 states have internal predecessors, (166), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 578 transitions. [2024-11-10 14:57:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-10 14:57:30,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:30,412 INFO L215 NwaCegarLoop]: trace histogram [68, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:30,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 14:57:30,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:30,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1986785734, now seen corresponding path program 2 times [2024-11-10 14:57:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040147965] [2024-11-10 14:57:30,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:57:30,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:30,615 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:30,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 14:57:31,496 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:57:31,496 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:57:31,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 14:57:31,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1138 proven. 253 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2024-11-10 14:57:32,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 2 proven. 1386 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2024-11-10 14:57:33,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040147965] [2024-11-10 14:57:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040147965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:33,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 14:57:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939168108] [2024-11-10 14:57:33,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 14:57:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 14:57:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 14:57:33,694 INFO L87 Difference]: Start difference. First operand 467 states and 578 transitions. Second operand has 50 states, 50 states have (on average 3.8) internal successors, (190), 50 states have internal predecessors, (190), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:57:38,982 INFO L93 Difference]: Finished difference Result 506 states and 650 transitions. [2024-11-10 14:57:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 14:57:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.8) internal successors, (190), 50 states have internal predecessors, (190), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 220 [2024-11-10 14:57:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:57:38,985 INFO L225 Difference]: With dead ends: 506 [2024-11-10 14:57:38,985 INFO L226 Difference]: Without dead ends: 502 [2024-11-10 14:57:38,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 14:57:38,987 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 8000 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8311 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:57:38,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8311 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 14:57:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-10 14:57:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 500. [2024-11-10 14:57:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 486 states have (on average 1.2366255144032923) internal successors, (601), 488 states have internal predecessors, (601), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-10 14:57:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 622 transitions. [2024-11-10 14:57:38,999 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 622 transitions. Word has length 220 [2024-11-10 14:57:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:57:38,999 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 622 transitions. [2024-11-10 14:57:38,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.8) internal successors, (190), 50 states have internal predecessors, (190), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:57:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 622 transitions. [2024-11-10 14:57:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-10 14:57:39,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:57:39,004 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:57:39,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 14:57:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:39,204 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:57:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:57:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -947925196, now seen corresponding path program 3 times [2024-11-10 14:57:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:57:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517068024] [2024-11-10 14:57:39,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:57:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:57:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:57:39,207 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:57:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 14:57:44,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2024-11-10 14:57:44,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:57:44,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 14:57:44,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:57:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9473 backedges. 2744 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-10 14:57:45,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:57:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9473 backedges. 2744 proven. 276 refuted. 0 times theorem prover too weak. 6453 trivial. 0 not checked. [2024-11-10 14:57:46,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:57:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517068024] [2024-11-10 14:57:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517068024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:57:46,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:57:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-10 14:57:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173909211] [2024-11-10 14:57:46,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:57:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 14:57:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:57:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 14:57:46,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 14:57:46,912 INFO L87 Difference]: Start difference. First operand 500 states and 622 transitions. Second operand has 52 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5)