./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/ldv-memsafety/memleaks_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:30,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:30,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:41:30,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:30,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:30,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:30,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:30,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:30,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:30,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:30,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:30,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:30,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:30,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:30,601 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:30,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:30,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:30,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:30,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2025-03-04 07:41:30,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:30,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:30,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:30,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:30,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:30,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2025-03-04 07:41:31,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cab12b93/323b57503ae94e5eb48f3bf404897bf2/FLAG00ab4eed0 [2025-03-04 07:41:32,175 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:32,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2025-03-04 07:41:32,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cab12b93/323b57503ae94e5eb48f3bf404897bf2/FLAG00ab4eed0 [2025-03-04 07:41:32,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cab12b93/323b57503ae94e5eb48f3bf404897bf2 [2025-03-04 07:41:32,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:32,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:32,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:32,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:32,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:32,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:32" (1/1) ... [2025-03-04 07:41:32,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0b99d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:32, skipping insertion in model container [2025-03-04 07:41:32,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:32" (1/1) ... [2025-03-04 07:41:32,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:32,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:32,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:32,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:32,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:32,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:32,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:32,757 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) [2025-03-04 07:41:32,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28975bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:32, skipping insertion in model container [2025-03-04 07:41:32,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:32,757 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:41:32,758 INFO L158 Benchmark]: Toolchain (without parser) took 255.18ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:32,759 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:32,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:32,759 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.2MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/21.0.5-tem/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.6.800.v20240513-1750.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/ldv-memsafety/memleaks_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:34,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:34,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:41:34,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:34,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:34,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:34,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:34,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:34,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:34,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:34,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:34,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:34,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:34,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:34,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:34,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:34,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:34,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:34,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2025-03-04 07:41:34,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:34,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:34,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:34,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:34,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:34,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2025-03-04 07:41:35,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4fe4dda/b34a88058af44ae2bb6ae0ac4753d333/FLAGd2bc0d7b1 [2025-03-04 07:41:36,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:36,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2025-03-04 07:41:36,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4fe4dda/b34a88058af44ae2bb6ae0ac4753d333/FLAGd2bc0d7b1 [2025-03-04 07:41:36,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4fe4dda/b34a88058af44ae2bb6ae0ac4753d333 [2025-03-04 07:41:36,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:36,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:36,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:36,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:36,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:36,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:36,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36, skipping insertion in model container [2025-03-04 07:41:36,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:36,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:36,764 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:36,817 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:41:36,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:36,856 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,877 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,881 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:41:36,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:36,890 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:36,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:36,967 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:36,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36 WrapperNode [2025-03-04 07:41:36,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:36,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:36,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:36,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:36,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:36,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:36,996 INFO L138 Inliner]: procedures = 167, calls = 91, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 64 [2025-03-04 07:41:36,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:36,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:36,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:36,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:37,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,017 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 07:41:37,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:37,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:37,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:37,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:37,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (1/1) ... [2025-03-04 07:41:37,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:37,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:37,055 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) [2025-03-04 07:41:37,060 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 [2025-03-04 07:41:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 07:41:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:41:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:37,167 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:37,169 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:37,197 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-04 07:41:37,418 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:37,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:37,428 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:37,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:37,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:37 BoogieIcfgContainer [2025-03-04 07:41:37,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:37,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:37,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:37,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:37,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:36" (1/3) ... [2025-03-04 07:41:37,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ae1354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:37, skipping insertion in model container [2025-03-04 07:41:37,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:36" (2/3) ... [2025-03-04 07:41:37,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ae1354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:37, skipping insertion in model container [2025-03-04 07:41:37,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:37" (3/3) ... [2025-03-04 07:41:37,437 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2025-03-04 07:41:37,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:37,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test10-1.i that has 2 procedures, 77 locations, 1 initial locations, 0 loop locations, and 34 error locations. [2025-03-04 07:41:37,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:37,489 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;@45448b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:37,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 07:41:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:41:37,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:37,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:37,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1169922738, now seen corresponding path program 1 times [2025-03-04 07:41:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:37,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1071817646] [2025-03-04 07:41:37,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:37,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:37,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:37,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:37,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:41:37,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:41:37,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:37,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:37,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:37,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:37,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:37,648 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071817646] [2025-03-04 07:41:37,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071817646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:41:37,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321032296] [2025-03-04 07:41:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:37,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:37,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:37,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:37,674 INFO L87 Difference]: Start difference. First operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:37,816 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2025-03-04 07:41:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:37,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-04 07:41:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:37,823 INFO L225 Difference]: With dead ends: 130 [2025-03-04 07:41:37,824 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 07:41:37,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:37,830 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:37,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 225 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 07:41:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 79. [2025-03-04 07:41:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 07:41:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2025-03-04 07:41:37,865 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 11 [2025-03-04 07:41:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:37,866 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2025-03-04 07:41:37,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2025-03-04 07:41:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:41:37,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:37,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:37,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:41:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:38,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash -282419057, now seen corresponding path program 1 times [2025-03-04 07:41:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226027425] [2025-03-04 07:41:38,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:38,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:38,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:38,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:41:38,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:41:38,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:38,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:38,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:38,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:38,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:38,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:38,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226027425] [2025-03-04 07:41:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226027425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:38,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:38,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:38,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447504698] [2025-03-04 07:41:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:38,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:38,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:38,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:38,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:38,166 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:38,353 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2025-03-04 07:41:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:38,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-04 07:41:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:38,354 INFO L225 Difference]: With dead ends: 144 [2025-03-04 07:41:38,354 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 07:41:38,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:38,355 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:38,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 247 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:41:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 07:41:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 75. [2025-03-04 07:41:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 36 states have (on average 2.0) internal successors, (72), 69 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-03-04 07:41:38,360 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 11 [2025-03-04 07:41:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-03-04 07:41:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:41:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-03-04 07:41:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:38,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:38,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:38,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1283388557, now seen corresponding path program 1 times [2025-03-04 07:41:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786249725] [2025-03-04 07:41:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:38,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:38,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:38,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:41:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:38,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:38,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:38,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:38,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:41:38,783 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:41:38,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:41:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:38,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:50,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786249725] [2025-03-04 07:41:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786249725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:50,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2025-03-04 07:41:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401127219] [2025-03-04 07:41:50,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:50,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:50,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:50,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2025-03-04 07:41:50,153 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:50,618 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2025-03-04 07:41:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2025-03-04 07:41:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:50,619 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:41:50,619 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:41:50,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2025-03-04 07:41:50,620 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:50,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 178 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:41:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:41:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-04 07:41:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 73 states have internal predecessors, (80), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 07:41:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2025-03-04 07:41:50,625 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 15 [2025-03-04 07:41:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:50,625 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2025-03-04 07:41:50,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2025-03-04 07:41:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:50,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:50,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:50,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:41:50,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:50,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:50,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1283388558, now seen corresponding path program 1 times [2025-03-04 07:41:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120014069] [2025-03-04 07:41:50,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:50,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:50,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:41:50,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:50,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:50,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:50,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:50,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:50,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:50,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:41:51,035 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-04 07:41:51,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:51,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:51,069 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:41:51,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:41:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-04 07:41:51,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:51,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120014069] [2025-03-04 07:41:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120014069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1976455185] [2025-03-04 07:41:51,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:51,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:51,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:41:51,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:41:51,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 07:41:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:51,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:51,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:51,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:51,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:41:51,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:51,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:41:51,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:51,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:51,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:41:51,446 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:41:51,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:41:51,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-04 07:41:51,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1976455185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:55,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-04 07:41:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448586706] [2025-03-04 07:41:55,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:55,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:41:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:55,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:41:55,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:41:55,573 INFO L87 Difference]: Start difference. First operand 81 states and 95 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:56,189 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2025-03-04 07:41:56,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:41:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-04 07:41:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:56,191 INFO L225 Difference]: With dead ends: 139 [2025-03-04 07:41:56,191 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:41:56,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2025-03-04 07:41:56,193 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 88 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:56,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 237 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 401 Invalid, 0 Unknown, 150 Unchecked, 0.5s Time] [2025-03-04 07:41:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:41:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2025-03-04 07:41:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.8) internal successors, (126), 99 states have internal predecessors, (126), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-04 07:41:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2025-03-04 07:41:56,200 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 15 [2025-03-04 07:41:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:56,200 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2025-03-04 07:41:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2025-03-04 07:41:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:41:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:56,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:56,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:41:56,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-04 07:41:56,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:56,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -513562802, now seen corresponding path program 1 times [2025-03-04 07:41:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:56,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345386331] [2025-03-04 07:41:56,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:56,605 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:41:56,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:41:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:41:56,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:56,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:56,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:56,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:56,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:56,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345386331] [2025-03-04 07:41:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345386331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:41:56,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977027796] [2025-03-04 07:41:56,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:41:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:41:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:56,688 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:56,724 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2025-03-04 07:41:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:41:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-03-04 07:41:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:56,725 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:41:56,725 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 07:41:56,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:56,726 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:56,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 07:41:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 07:41:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 63 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:41:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2025-03-04 07:41:56,729 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 15 [2025-03-04 07:41:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:56,730 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2025-03-04 07:41:56,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:41:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2025-03-04 07:41:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:41:56,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:56,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:56,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:41:56,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:56,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:56,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 599194073, now seen corresponding path program 1 times [2025-03-04 07:41:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628876928] [2025-03-04 07:41:56,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:56,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:56,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:56,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:41:56,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:41:56,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:41:56,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:56,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:41:56,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:57,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:41:57,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:41:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:41:57,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:41:57,040 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:57,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628876928] [2025-03-04 07:41:57,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628876928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:41:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933802292] [2025-03-04 07:41:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:57,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:57,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:57,041 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:41:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:57,135 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-04 07:41:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-04 07:41:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:57,136 INFO L225 Difference]: With dead ends: 78 [2025-03-04 07:41:57,136 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 07:41:57,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:57,137 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:57,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 288 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 07:41:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-03-04 07:41:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 66 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:41:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2025-03-04 07:41:57,145 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 20 [2025-03-04 07:41:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:57,145 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2025-03-04 07:41:57,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:41:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2025-03-04 07:41:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:41:57,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:57,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:57,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:41:57,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:57,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:57,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1208260390, now seen corresponding path program 1 times [2025-03-04 07:41:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426879594] [2025-03-04 07:41:57,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:57,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:57,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:57,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:57,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:41:57,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:41:57,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:41:57,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:57,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:41:57,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:57,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:41:57,492 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426879594] [2025-03-04 07:41:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426879594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:57,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2025-03-04 07:41:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411776127] [2025-03-04 07:41:57,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:57,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:57,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:57,493 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:57,614 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-04 07:41:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2025-03-04 07:41:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:57,615 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:41:57,615 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 07:41:57,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:57,616 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 89 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:57,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 126 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 07:41:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 07:41:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.511111111111111) internal successors, (68), 65 states have internal predecessors, (68), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:41:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-04 07:41:57,623 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 20 [2025-03-04 07:41:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-04 07:41:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:41:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-04 07:41:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:41:57,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:57,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:57,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:57,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:57,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 835607406, now seen corresponding path program 1 times [2025-03-04 07:41:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629165350] [2025-03-04 07:41:57,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:57,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:57,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:41:57,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:41:57,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:41:57,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:57,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:57,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:57,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:58,007 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_32| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~a10~0#1.base_32| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~a10~0#1.base_32|)))) is different from true [2025-03-04 07:41:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:41:58,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:58,094 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2025-03-04 07:41:58,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2025-03-04 07:41:58,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:41:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629165350] [2025-03-04 07:41:58,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629165350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:58,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1301617745] [2025-03-04 07:41:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:58,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:41:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:41:58,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:41:58,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-04 07:41:58,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:41:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:41:58,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:58,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:58,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:41:58,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:41:58,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:58,600 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2025-03-04 07:41:58,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2025-03-04 07:41:58,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1301617745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:58,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:58,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-03-04 07:41:58,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398383245] [2025-03-04 07:41:58,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:58,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:41:58,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:41:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:41:58,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=105, Unknown=2, NotChecked=20, Total=156 [2025-03-04 07:41:58,714 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:59,252 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2025-03-04 07:41:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:41:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2025-03-04 07:41:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:59,254 INFO L225 Difference]: With dead ends: 114 [2025-03-04 07:41:59,254 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:41:59,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=220, Unknown=2, NotChecked=30, Total=306 [2025-03-04 07:41:59,254 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:59,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 265 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 382 Invalid, 0 Unknown, 122 Unchecked, 0.4s Time] [2025-03-04 07:41:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:41:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2025-03-04 07:41:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 59 states have internal predecessors, (60), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:41:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-03-04 07:41:59,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2025-03-04 07:41:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:59,258 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-03-04 07:41:59,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:41:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-03-04 07:41:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:41:59,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:59,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:59,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-04 07:41:59,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:41:59,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:59,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:41:59,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1969068905, now seen corresponding path program 1 times [2025-03-04 07:41:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:41:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944762344] [2025-03-04 07:41:59,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:59,664 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:59,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:41:59,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:41:59,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:41:59,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:59,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:59,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:41:59,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:41:59,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:41:59,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:41:59,846 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:41:59,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:41:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:41:59,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:42:09,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944762344] [2025-03-04 07:42:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944762344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:09,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-04 07:42:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223365330] [2025-03-04 07:42:09,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:42:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:42:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=66, Unknown=2, NotChecked=0, Total=90 [2025-03-04 07:42:09,548 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:42:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:09,956 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2025-03-04 07:42:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:42:09,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 07:42:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:09,957 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:42:09,957 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:42:09,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=32, Invalid=98, Unknown=2, NotChecked=0, Total=132 [2025-03-04 07:42:09,958 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:09,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 233 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:42:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:42:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-04 07:42:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 64 states have internal predecessors, (67), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:42:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-03-04 07:42:09,966 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 25 [2025-03-04 07:42:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-03-04 07:42:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:42:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-03-04 07:42:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:42:09,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:09,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:09,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:42:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:10,168 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:10,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1969068904, now seen corresponding path program 1 times [2025-03-04 07:42:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115714345] [2025-03-04 07:42:10,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:10,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:10,170 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:10,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:42:10,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:42:10,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:42:10,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:10,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:42:10,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:10,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:42:10,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:10,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:10,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:10,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-04 07:42:10,418 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-04 07:42:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:42:10,453 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:10,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-04 07:42:10,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:14,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115714345] [2025-03-04 07:42:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115714345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [735259734] [2025-03-04 07:42:14,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:14,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:14,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-04 07:42:14,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:42:14,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:42:14,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:14,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:14,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:42:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:14,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:42:14,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:14,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:14,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:14,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-04 07:42:14,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:42:14,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:42:14,886 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:14,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-04 07:42:14,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:15,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [735259734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:15,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:15,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-04 07:42:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866846151] [2025-03-04 07:42:15,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:15,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:42:15,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:15,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:42:15,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=87, Unknown=2, NotChecked=18, Total=132 [2025-03-04 07:42:15,019 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:42:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:15,450 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2025-03-04 07:42:15,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:42:15,450 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-04 07:42:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:15,451 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:42:15,451 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:42:15,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=39, Invalid=145, Unknown=2, NotChecked=24, Total=210 [2025-03-04 07:42:15,452 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:15,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2025-03-04 07:42:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:42:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-04 07:42:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.5) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:42:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2025-03-04 07:42:15,455 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 25 [2025-03-04 07:42:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:15,455 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-03-04 07:42:15,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:42:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2025-03-04 07:42:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:42:15,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:15,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:15,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-03-04 07:42:15,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:42:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:15,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1820339766, now seen corresponding path program 1 times [2025-03-04 07:42:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278367528] [2025-03-04 07:42:15,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:15,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:15,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:42:15,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:42:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:42:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:42:15,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:15,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:15,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:42:15,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:15,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278367528] [2025-03-04 07:42:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278367528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:42:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199237399] [2025-03-04 07:42:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:42:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:15,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:42:15,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:42:15,980 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:42:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:16,070 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-04 07:42:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:42:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-04 07:42:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:16,071 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:42:16,071 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:42:16,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:42:16,071 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:16,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 309 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:42:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:42:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 07:42:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 57 states have internal predecessors, (58), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2025-03-04 07:42:16,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 25 [2025-03-04 07:42:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:16,074 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2025-03-04 07:42:16,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:42:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2025-03-04 07:42:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:42:16,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:16,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:16,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:42:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:16,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 131607618, now seen corresponding path program 1 times [2025-03-04 07:42:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83876806] [2025-03-04 07:42:16,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:16,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:16,280 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:16,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:42:16,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:16,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:16,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:16,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:16,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:42:16,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:16,397 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:16,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:16,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:20,473 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_12|))) is different from true [2025-03-04 07:42:20,521 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:42:20,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:42:20,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:42:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-04 07:42:20,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:20,608 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2025-03-04 07:42:20,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:42:20,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:20,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83876806] [2025-03-04 07:42:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83876806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [705526917] [2025-03-04 07:42:20,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:20,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:20,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:20,655 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:20,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-04 07:42:20,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:20,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:20,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:20,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:42:20,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:20,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:20,789 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:20,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:20,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:24,822 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_4|)))) is different from true [2025-03-04 07:42:24,868 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:42:24,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:42:24,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:42:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-04 07:42:24,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:24,910 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2025-03-04 07:42:24,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:42:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [705526917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:24,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2025-03-04 07:42:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929342018] [2025-03-04 07:42:24,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:42:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:24,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:42:24,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=10, NotChecked=50, Total=240 [2025-03-04 07:42:24,951 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:42:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:33,452 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-03-04 07:42:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:42:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-04 07:42:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:33,453 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:42:33,453 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:42:33,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=72, Invalid=341, Unknown=15, NotChecked=78, Total=506 [2025-03-04 07:42:33,454 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 64 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:33,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 325 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 428 Invalid, 0 Unknown, 166 Unchecked, 0.4s Time] [2025-03-04 07:42:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:42:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2025-03-04 07:42:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-03-04 07:42:33,456 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 28 [2025-03-04 07:42:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:33,456 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-03-04 07:42:33,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:42:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-03-04 07:42:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:42:33,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:33,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:33,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-04 07:42:33,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:42:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:33,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 131607619, now seen corresponding path program 1 times [2025-03-04 07:42:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485157267] [2025-03-04 07:42:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:33,864 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:33,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:42:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:33,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:33,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:33,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:42:33,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:33,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:33,978 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:33,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:33,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:34,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:34,161 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:42:34,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:42:34,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:42:34,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:42:34,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:42:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:34,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:34,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:42:34,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2025-03-04 07:42:34,367 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_prenex_7) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem51#1.offset|))) (or (forall ((v_prenex_7 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_prenex_7) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_229) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_228) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2025-03-04 07:42:34,390 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:34,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485157267] [2025-03-04 07:42:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485157267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [675703547] [2025-03-04 07:42:34,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:34,391 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:34,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:34,393 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:34,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-04 07:42:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:42:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:42:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:34,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:42:34,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:34,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:34,540 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:34,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:34,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:34,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:34,665 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:42:34,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:42:34,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:42:34,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:42:34,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:42:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:34,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:34,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:42:34,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2025-03-04 07:42:34,768 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_254 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_254) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_ArrVal_253 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_#t~mem51#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_253) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_prenex_9) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_254 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_#t~mem51#1.base| v_ArrVal_254) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem51#1.offset|)))) is different from false [2025-03-04 07:42:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [675703547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:34,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-04 07:42:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209009130] [2025-03-04 07:42:34,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:34,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:42:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:34,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:42:34,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=178, Unknown=2, NotChecked=54, Total=272 [2025-03-04 07:42:34,790 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:42:38,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:42,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:42,271 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2025-03-04 07:42:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:42:42,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-03-04 07:42:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:42,273 INFO L225 Difference]: With dead ends: 93 [2025-03-04 07:42:42,273 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 07:42:42,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=385, Unknown=2, NotChecked=82, Total=552 [2025-03-04 07:42:42,274 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:42,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2025-03-04 07:42:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 07:42:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2025-03-04 07:42:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-03-04 07:42:42,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 28 [2025-03-04 07:42:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:42,276 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-03-04 07:42:42,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:42:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-03-04 07:42:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:42:42,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:42,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-04 07:42:42,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:42:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:42,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:42,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:42,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1920869979, now seen corresponding path program 1 times [2025-03-04 07:42:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41463757] [2025-03-04 07:42:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:42,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:42:42,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:42:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:42:42,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:42,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:42,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:42:42,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:42:42,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:42,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41463757] [2025-03-04 07:42:42,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41463757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:42,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:42,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:42:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124541309] [2025-03-04 07:42:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:42,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:42:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:42,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:42:42,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:42:42,760 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:42,843 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-03-04 07:42:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:42:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-04 07:42:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:42,844 INFO L225 Difference]: With dead ends: 68 [2025-03-04 07:42:42,844 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 07:42:42,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:42:42,844 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:42,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:42:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 07:42:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 07:42:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-04 07:42:42,846 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 30 [2025-03-04 07:42:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-04 07:42:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-04 07:42:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:42:42,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:42,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:42,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:42:43,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:43,052 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:43,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1920869980, now seen corresponding path program 1 times [2025-03-04 07:42:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:43,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087982943] [2025-03-04 07:42:43,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:43,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:43,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:43,054 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:43,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 07:42:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:42:43,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:42:43,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:43,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:43,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:42:43,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:42:43,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:43,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-04 07:42:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:42:43,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087982943] [2025-03-04 07:42:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087982943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:42:43,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 07:42:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011690811] [2025-03-04 07:42:43,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:43,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:42:43,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:43,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:42:43,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:42:43,331 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:42:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:43,567 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-03-04 07:42:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:42:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2025-03-04 07:42:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:43,567 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:42:43,567 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 07:42:43,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:42:43,568 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:43,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 234 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:42:43,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 07:42:43,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 07:42:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-04 07:42:43,570 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 30 [2025-03-04 07:42:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-04 07:42:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:42:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-04 07:42:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:42:43,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:43,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:43,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 07:42:43,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:43,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash -582575473, now seen corresponding path program 1 times [2025-03-04 07:42:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328990840] [2025-03-04 07:42:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:43,775 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:43,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 07:42:43,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:43,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:43,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:43,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:43,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:42:43,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:43,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:43,883 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:43,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:43,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:43,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:42:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:42:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:44,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:44,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328990840] [2025-03-04 07:42:44,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328990840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1753203287] [2025-03-04 07:42:44,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:42:44,057 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:42:44,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-03-04 07:42:44,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:44,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:42:44,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:44,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:44,201 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:44,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:44,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:44,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:44,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:42:44,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:42:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:42:44,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:42:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1753203287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:42:44,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:42:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2025-03-04 07:42:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978106317] [2025-03-04 07:42:44,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:42:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:42:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:44,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:42:44,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=141, Unknown=10, NotChecked=0, Total=182 [2025-03-04 07:42:44,355 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:42:48,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:52,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:56,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:42:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:56,765 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-03-04 07:42:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:42:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2025-03-04 07:42:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:56,766 INFO L225 Difference]: With dead ends: 88 [2025-03-04 07:42:56,766 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 07:42:56,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=329, Unknown=15, NotChecked=0, Total=420 [2025-03-04 07:42:56,767 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 76 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:56,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 286 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 371 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-04 07:42:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 07:42:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2025-03-04 07:42:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 60 states have internal predecessors, (62), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-04 07:42:56,773 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 31 [2025-03-04 07:42:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:56,773 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-04 07:42:56,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:42:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-04 07:42:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:42:56,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:56,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:56,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 07:42:56,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2025-03-04 07:42:57,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 07:42:57,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:57,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash -582572784, now seen corresponding path program 1 times [2025-03-04 07:42:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150834079] [2025-03-04 07:42:57,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:57,177 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:57,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 07:42:57,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:57,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:57,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:42:57,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:57,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:42:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:42:57,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:57,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150834079] [2025-03-04 07:42:57,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150834079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:57,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:42:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816163895] [2025-03-04 07:42:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:57,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:42:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:57,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:42:57,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:42:57,279 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:57,420 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2025-03-04 07:42:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:42:57,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 07:42:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:57,421 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:42:57,421 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 07:42:57,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:42:57,421 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:57,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:42:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 07:42:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-03-04 07:42:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 59 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-03-04 07:42:57,423 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 31 [2025-03-04 07:42:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:57,423 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-03-04 07:42:57,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-03-04 07:42:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:42:57,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:57,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:57,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 07:42:57,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:57,625 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:57,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -582572783, now seen corresponding path program 1 times [2025-03-04 07:42:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:57,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798072760] [2025-03-04 07:42:57,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:57,627 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:57,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 07:42:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:42:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:42:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:57,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:42:57,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:57,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-04 07:42:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 07:42:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:42:57,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:42:57,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:42:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798072760] [2025-03-04 07:42:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798072760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:42:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:42:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:42:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769990748] [2025-03-04 07:42:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:42:57,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:42:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:42:57,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:42:57,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:42:57,793 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:42:58,014 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2025-03-04 07:42:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:42:58,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 07:42:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:42:58,015 INFO L225 Difference]: With dead ends: 71 [2025-03-04 07:42:58,015 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 07:42:58,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:42:58,016 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:42:58,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 188 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:42:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 07:42:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2025-03-04 07:42:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 58 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:42:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-03-04 07:42:58,018 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 31 [2025-03-04 07:42:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:42:58,018 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-03-04 07:42:58,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:42:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-03-04 07:42:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:42:58,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:42:58,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:42:58,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 07:42:58,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:58,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 31 more)] === [2025-03-04 07:42:58,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:42:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash -879970493, now seen corresponding path program 1 times [2025-03-04 07:42:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:42:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608966141] [2025-03-04 07:42:58,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:42:58,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:42:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:42:58,222 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:42:58,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 07:42:58,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:42:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:42:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:42:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:42:58,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 07:42:58,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:42:58,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:42:58,331 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:42:58,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:42:58,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:42:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:42:58,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:43:02,404 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_13|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_24|))) is different from true [2025-03-04 07:43:02,522 INFO L349 Elim1Store]: treesize reduction 60, result has 27.7 percent of original size [2025-03-04 07:43:02,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 53 [2025-03-04 07:43:02,604 INFO L349 Elim1Store]: treesize reduction 29, result has 29.3 percent of original size [2025-03-04 07:43:02,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:43:02,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:43:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-04 07:43:02,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:43:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:43:07,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:43:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608966141] [2025-03-04 07:43:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608966141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:43:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1223414327] [2025-03-04 07:43:07,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:43:07,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:43:07,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:43:07,429 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:43:07,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2025-03-04 07:43:07,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:43:07,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:43:07,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:43:07,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:43:07,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:43:07,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:43:07,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:43:07,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:43:07,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:43:07,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:43:07,908 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:43:07,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2025-03-04 07:43:07,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:43:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:43:07,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:43:08,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1223414327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:43:08,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:43:08,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2025-03-04 07:43:08,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73898063] [2025-03-04 07:43:08,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:43:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:43:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:43:08,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:43:08,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=719, Unknown=24, NotChecked=54, Total=870 [2025-03-04 07:43:08,130 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 07:43:13,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:43:17,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]