./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/uthash-2.0.2/uthash_JEN_test10-2.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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:39:27,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:39:27,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:39:27,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:39:27,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:39:27,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:39:27,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:39:27,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:39:27,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:39:27,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:39:27,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:39:27,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:39:27,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:39:27,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:39:27,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:39:27,510 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:39:27,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:39:27,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:39:27,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:39:27,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:39:27,512 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2025-03-09 00:39:27,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:39:27,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:39:27,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:39:27,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:39:27,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:39:27,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-09 00:39:28,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926821ddc/04596a15933a466b8befbca156d5c221/FLAG8e0496f70 [2025-03-09 00:39:29,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:39:29,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-09 00:39:29,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926821ddc/04596a15933a466b8befbca156d5c221/FLAG8e0496f70 [2025-03-09 00:39:29,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926821ddc/04596a15933a466b8befbca156d5c221 [2025-03-09 00:39:29,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:39:29,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:39:29,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:39:29,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:39:29,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:39:29,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:39:29" (1/1) ... [2025-03-09 00:39:29,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:29, skipping insertion in model container [2025-03-09 00:39:29,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:39:29" (1/1) ... [2025-03-09 00:39:29,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:39:29,652 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-09 00:39:29,674 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-09 00:39:29,677 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-09 00:39:29,679 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-09 00:39:29,686 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-09 00:39:29,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-09 00:39:29,719 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-09 00:39:29,721 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-09 00:39:29,726 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-09 00:39:29,742 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-09 00:39:29,742 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-09 00:39:29,744 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-09 00:39:29,744 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-09 00:39:29,753 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-09 00:39:29,753 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-09 00:39:29,754 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-09 00:39:29,754 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-09 00:39:29,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-09 00:39:29,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-09 00:39:29,765 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-09 00:39:29,765 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-09 00:39:29,772 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-09 00:39:29,772 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-09 00:39:29,773 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-09 00:39:29,773 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-09 00:39:29,774 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-09 00:39:29,775 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-09 00:39:29,776 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-09 00:39:29,776 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-09 00:39:29,776 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-09 00:39:29,778 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-09 00:39:29,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:39:29,798 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-09 00:39:29,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5aa63ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:29, skipping insertion in model container [2025-03-09 00:39:29,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:39:29,799 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-09 00:39:29,800 INFO L158 Benchmark]: Toolchain (without parser) took 455.30ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 91.1MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:39:29,801 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:39:29,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.17ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 91.1MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:39:29,803 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.17ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 91.1MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/uthash-2.0.2/uthash_JEN_test10-2.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 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:39:31,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:39:31,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:39:31,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:39:31,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:39:31,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:39:31,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:39:31,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:39:31,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:39:31,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:39:31,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:39:31,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:39:31,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:39:31,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:39:31,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:39:31,531 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:39:31,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:39:31,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:39:31,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:39:31,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:39:31,533 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:39:31,533 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:39:31,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:39:31,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:39:31,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:39:31,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:39:31,534 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2025-03-09 00:39:31,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:39:31,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:39:31,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:39:31,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:39:31,800 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:39:31,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-09 00:39:32,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac4eac44/72570bf84ecc4c1096d8f994fba559bb/FLAG07c22c062 [2025-03-09 00:39:33,205 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:39:33,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2025-03-09 00:39:33,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac4eac44/72570bf84ecc4c1096d8f994fba559bb/FLAG07c22c062 [2025-03-09 00:39:33,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac4eac44/72570bf84ecc4c1096d8f994fba559bb [2025-03-09 00:39:33,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:39:33,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:39:33,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:39:33,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:39:33,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:39:33,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:39:33" (1/1) ... [2025-03-09 00:39:33,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6676ab4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:33, skipping insertion in model container [2025-03-09 00:39:33,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:39:33" (1/1) ... [2025-03-09 00:39:33,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:39:33,606 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-09 00:39:33,645 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-09 00:39:33,651 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-09 00:39:33,655 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-09 00:39:33,662 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-09 00:39:33,685 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-09 00:39:33,687 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-09 00:39:33,689 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-09 00:39:33,692 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-09 00:39:33,712 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-09 00:39:33,712 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-09 00:39:33,714 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-09 00:39:33,714 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-09 00:39:33,723 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-09 00:39:33,724 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-09 00:39:33,725 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-09 00:39:33,726 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-09 00:39:33,739 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-09 00:39:33,740 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-09 00:39:33,741 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-09 00:39:33,741 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-09 00:39:33,756 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-09 00:39:33,757 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-09 00:39:33,758 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-09 00:39:33,760 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-09 00:39:33,761 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-09 00:39:33,763 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-09 00:39:33,767 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-09 00:39:33,767 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-09 00:39:33,768 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-09 00:39:33,770 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-09 00:39:33,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:39:33,799 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-09 00:39:33,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:39:33,845 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-09 00:39:33,854 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-09 00:39:33,855 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-09 00:39:33,857 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-09 00:39:33,859 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-09 00:39:33,884 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-09 00:39:33,885 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-09 00:39:33,886 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-09 00:39:33,890 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-09 00:39:33,901 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-09 00:39:33,902 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-09 00:39:33,902 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-09 00:39:33,903 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-09 00:39:33,909 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-09 00:39:33,910 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-09 00:39:33,912 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-09 00:39:33,915 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-09 00:39:33,922 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-09 00:39:33,922 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-09 00:39:33,924 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-09 00:39:33,924 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-09 00:39:33,928 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-09 00:39:33,929 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-09 00:39:33,930 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-09 00:39:33,930 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-09 00:39:33,932 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-09 00:39:33,933 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-09 00:39:33,934 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-09 00:39:33,934 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-09 00:39:33,934 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-09 00:39:33,935 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-09 00:39:33,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:39:33,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:39:34,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:39:34,076 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:39:34,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34 WrapperNode [2025-03-09 00:39:34,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:39:34,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:39:34,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:39:34,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:39:34,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,198 INFO L138 Inliner]: procedures = 180, calls = 558, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2327 [2025-03-09 00:39:34,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:39:34,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:39:34,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:39:34,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:39:34,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,319 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 106, 420]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 4, 90]. [2025-03-09 00:39:34,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:39:34,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:39:34,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:39:34,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:39:34,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (1/1) ... [2025-03-09 00:39:34,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:39:34,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:34,453 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-09 00:39:34,458 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-09 00:39:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 00:39:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 00:39:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-09 00:39:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-09 00:39:34,479 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-09 00:39:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 00:39:34,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 00:39:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 00:39:34,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 00:39:34,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 00:39:34,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 00:39:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 00:39:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:39:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 00:39:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 00:39:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:39:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:39:34,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:39:34,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:39:34,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:39:40,005 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-09 00:39:40,210 INFO L? ?]: Removed 2231 outVars from TransFormulas that were not future-live. [2025-03-09 00:39:40,211 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:39:40,248 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:39:40,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:39:40,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:39:40 BoogieIcfgContainer [2025-03-09 00:39:40,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:39:40,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:39:40,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:39:40,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:39:40,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:39:33" (1/3) ... [2025-03-09 00:39:40,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f09a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:39:40, skipping insertion in model container [2025-03-09 00:39:40,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:39:34" (2/3) ... [2025-03-09 00:39:40,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f09a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:39:40, skipping insertion in model container [2025-03-09 00:39:40,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:39:40" (3/3) ... [2025-03-09 00:39:40,255 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2025-03-09 00:39:40,265 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:39:40,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test10-2.i that has 6 procedures, 2271 locations, 1 initial locations, 83 loop locations, and 1091 error locations. [2025-03-09 00:39:40,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:39:40,332 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;@1abff84a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:39:40,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1091 error locations. [2025-03-09 00:39:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 2261 states, 1158 states have (on average 2.192573402417962) internal successors, (2539), 2247 states have internal predecessors, (2539), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 00:39:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:39:40,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:40,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:39:40,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1088REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:40,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2577795, now seen corresponding path program 1 times [2025-03-09 00:39:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925991532] [2025-03-09 00:39:40,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:40,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:40,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:40,361 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-09 00:39:40,363 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-09 00:39:40,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:39:40,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:39:40,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:40,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:40,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:39:40,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:40,545 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-09 00:39:40,561 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-09 00:39:40,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:40,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925991532] [2025-03-09 00:39:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925991532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:40,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:39:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925068164] [2025-03-09 00:39:40,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:40,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:39:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:40,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:39:40,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:40,594 INFO L87 Difference]: Start difference. First operand has 2261 states, 1158 states have (on average 2.192573402417962) internal successors, (2539), 2247 states have internal predecessors, (2539), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:43,051 INFO L93 Difference]: Finished difference Result 2921 states and 3105 transitions. [2025-03-09 00:39:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:39:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:39:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:43,070 INFO L225 Difference]: With dead ends: 2921 [2025-03-09 00:39:43,070 INFO L226 Difference]: Without dead ends: 2919 [2025-03-09 00:39:43,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:43,073 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 2127 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:43,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1859 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-09 00:39:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2025-03-09 00:39:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2403. [2025-03-09 00:39:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 1328 states have (on average 2.036144578313253) internal successors, (2704), 2387 states have internal predecessors, (2704), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 00:39:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 2736 transitions. [2025-03-09 00:39:43,161 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 2736 transitions. Word has length 3 [2025-03-09 00:39:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:43,162 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 2736 transitions. [2025-03-09 00:39:43,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2736 transitions. [2025-03-09 00:39:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 00:39:43,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:43,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 00:39:43,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:39:43,362 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-09 00:39:43,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1089REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2577796, now seen corresponding path program 1 times [2025-03-09 00:39:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825177982] [2025-03-09 00:39:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:43,366 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-09 00:39:43,366 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-09 00:39:43,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 00:39:43,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 00:39:43,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:43,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:43,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:39:43,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:43,504 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-09 00:39:43,514 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-09 00:39:43,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:43,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825177982] [2025-03-09 00:39:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825177982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:39:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306496021] [2025-03-09 00:39:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:43,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:39:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:43,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:39:43,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:43,516 INFO L87 Difference]: Start difference. First operand 2403 states and 2736 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:46,971 INFO L93 Difference]: Finished difference Result 3196 states and 3609 transitions. [2025-03-09 00:39:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:39:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 00:39:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:46,981 INFO L225 Difference]: With dead ends: 3196 [2025-03-09 00:39:46,981 INFO L226 Difference]: Without dead ends: 3196 [2025-03-09 00:39:46,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:46,982 INFO L435 NwaCegarLoop]: 2023 mSDtfsCounter, 867 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:46,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 3315 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-09 00:39:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2025-03-09 00:39:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2868. [2025-03-09 00:39:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 1791 states have (on average 1.993858179787828) internal successors, (3571), 2849 states have internal predecessors, (3571), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:39:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 3609 transitions. [2025-03-09 00:39:47,040 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 3609 transitions. Word has length 3 [2025-03-09 00:39:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:47,040 INFO L471 AbstractCegarLoop]: Abstraction has 2868 states and 3609 transitions. [2025-03-09 00:39:47,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 3609 transitions. [2025-03-09 00:39:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 00:39:47,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:47,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:47,047 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-09 00:39:47,241 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-09 00:39:47,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1085REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:47,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1313755039, now seen corresponding path program 1 times [2025-03-09 00:39:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:47,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919358099] [2025-03-09 00:39:47,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:47,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:47,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:47,244 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-09 00:39:47,245 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-09 00:39:47,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 00:39:47,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 00:39:47,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:47,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:47,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:39:47,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:47,396 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-09 00:39:47,452 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-03-09 00:39:47,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2025-03-09 00:39:47,515 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-09 00:39:47,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:47,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919358099] [2025-03-09 00:39:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919358099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:47,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:47,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:39:47,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240154458] [2025-03-09 00:39:47,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:47,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:39:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:47,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:39:47,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:39:47,516 INFO L87 Difference]: Start difference. First operand 2868 states and 3609 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:52,915 INFO L93 Difference]: Finished difference Result 4542 states and 5068 transitions. [2025-03-09 00:39:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:39:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 00:39:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:52,925 INFO L225 Difference]: With dead ends: 4542 [2025-03-09 00:39:52,925 INFO L226 Difference]: Without dead ends: 4542 [2025-03-09 00:39:52,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 00:39:52,936 INFO L435 NwaCegarLoop]: 2283 mSDtfsCounter, 2311 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 3136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 4861 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:52,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2317 Valid, 4861 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3136 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-09 00:39:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2025-03-09 00:39:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 3150. [2025-03-09 00:39:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 2073 states have (on average 1.990352146647371) internal successors, (4126), 3131 states have internal predecessors, (4126), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:39:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 4164 transitions. [2025-03-09 00:39:52,983 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 4164 transitions. Word has length 7 [2025-03-09 00:39:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:52,984 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 4164 transitions. [2025-03-09 00:39:52,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 4164 transitions. [2025-03-09 00:39:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 00:39:52,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:52,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:52,993 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-09 00:39:53,186 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-09 00:39:53,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1082REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2071703030, now seen corresponding path program 1 times [2025-03-09 00:39:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476220582] [2025-03-09 00:39:53,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:53,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:53,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:53,190 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-09 00:39:53,191 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-09 00:39:53,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:39:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:39:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:53,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:39:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:53,325 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-09 00:39:53,333 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-09 00:39:53,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:53,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476220582] [2025-03-09 00:39:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476220582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:39:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888611763] [2025-03-09 00:39:53,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:53,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:39:53,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:39:53,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:53,334 INFO L87 Difference]: Start difference. First operand 3150 states and 4164 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:55,504 INFO L93 Difference]: Finished difference Result 3854 states and 4907 transitions. [2025-03-09 00:39:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:39:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 00:39:55,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:55,512 INFO L225 Difference]: With dead ends: 3854 [2025-03-09 00:39:55,512 INFO L226 Difference]: Without dead ends: 3854 [2025-03-09 00:39:55,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:55,514 INFO L435 NwaCegarLoop]: 2201 mSDtfsCounter, 1906 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:55,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 2869 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-09 00:39:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3854 states. [2025-03-09 00:39:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3854 to 3058. [2025-03-09 00:39:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 2073 states have (on average 1.9257115291847564) internal successors, (3992), 3039 states have internal predecessors, (3992), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:39:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 4030 transitions. [2025-03-09 00:39:55,556 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 4030 transitions. Word has length 8 [2025-03-09 00:39:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:55,556 INFO L471 AbstractCegarLoop]: Abstraction has 3058 states and 4030 transitions. [2025-03-09 00:39:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 4030 transitions. [2025-03-09 00:39:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 00:39:55,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:55,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:55,564 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-09 00:39:55,757 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 [2025-03-09 00:39:55,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1083REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:55,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2071703031, now seen corresponding path program 1 times [2025-03-09 00:39:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291142164] [2025-03-09 00:39:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:55,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:39:55,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:39:55,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:39:55,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:39:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:55,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:55,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:39:55,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:55,914 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-09 00:39:55,928 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-09 00:39:55,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:55,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:55,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291142164] [2025-03-09 00:39:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291142164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:39:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211392408] [2025-03-09 00:39:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:39:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:39:55,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:55,930 INFO L87 Difference]: Start difference. First operand 3058 states and 4030 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:39:59,103 INFO L93 Difference]: Finished difference Result 4652 states and 6112 transitions. [2025-03-09 00:39:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:39:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 00:39:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:39:59,112 INFO L225 Difference]: With dead ends: 4652 [2025-03-09 00:39:59,112 INFO L226 Difference]: Without dead ends: 4652 [2025-03-09 00:39:59,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:39:59,112 INFO L435 NwaCegarLoop]: 2553 mSDtfsCounter, 1411 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 3647 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:39:59,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 3647 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-09 00:39:59,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2025-03-09 00:39:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 3223. [2025-03-09 00:39:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2248 states have (on average 1.9083629893238434) internal successors, (4290), 3204 states have internal predecessors, (4290), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:39:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4328 transitions. [2025-03-09 00:39:59,154 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4328 transitions. Word has length 8 [2025-03-09 00:39:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:39:59,154 INFO L471 AbstractCegarLoop]: Abstraction has 3223 states and 4328 transitions. [2025-03-09 00:39:59,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:39:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4328 transitions. [2025-03-09 00:39:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:39:59,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:39:59,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:39:59,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:39:59,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:59,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr450REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:39:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:39:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1048584076, now seen corresponding path program 1 times [2025-03-09 00:39:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:39:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15004415] [2025-03-09 00:39:59,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:39:59,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:39:59,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:39:59,359 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-09 00:39:59,360 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-09 00:39:59,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:39:59,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:39:59,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:39:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:39:59,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:39:59,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:39:59,493 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-09 00:39:59,511 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-09 00:39:59,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:39:59,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:39:59,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15004415] [2025-03-09 00:39:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15004415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:39:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:39:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:39:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898850620] [2025-03-09 00:39:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:39:59,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:39:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:39:59,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:39:59,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:39:59,512 INFO L87 Difference]: Start difference. First operand 3223 states and 4328 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:02,153 INFO L93 Difference]: Finished difference Result 3687 states and 4642 transitions. [2025-03-09 00:40:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 00:40:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:02,160 INFO L225 Difference]: With dead ends: 3687 [2025-03-09 00:40:02,160 INFO L226 Difference]: Without dead ends: 3687 [2025-03-09 00:40:02,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-09 00:40:02,161 INFO L435 NwaCegarLoop]: 1333 mSDtfsCounter, 2090 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:02,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 2992 Invalid, 2372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-09 00:40:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2025-03-09 00:40:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3200. [2025-03-09 00:40:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 2248 states have (on average 1.887900355871886) internal successors, (4244), 3181 states have internal predecessors, (4244), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 4282 transitions. [2025-03-09 00:40:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 4282 transitions. Word has length 10 [2025-03-09 00:40:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 3200 states and 4282 transitions. [2025-03-09 00:40:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 4282 transitions. [2025-03-09 00:40:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 00:40:02,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:02,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:02,212 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-09 00:40:02,405 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-09 00:40:02,406 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr451REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:02,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1048584077, now seen corresponding path program 1 times [2025-03-09 00:40:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563676135] [2025-03-09 00:40:02,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:02,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:02,409 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-09 00:40:02,410 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-09 00:40:02,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:40:02,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:40:02,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:02,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:02,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:40:02,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:02,551 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-09 00:40:02,594 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-09 00:40:02,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:02,594 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563676135] [2025-03-09 00:40:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563676135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:02,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162632751] [2025-03-09 00:40:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:02,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:02,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:02,597 INFO L87 Difference]: Start difference. First operand 3200 states and 4282 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:06,056 INFO L93 Difference]: Finished difference Result 3941 states and 5095 transitions. [2025-03-09 00:40:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 00:40:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:06,065 INFO L225 Difference]: With dead ends: 3941 [2025-03-09 00:40:06,065 INFO L226 Difference]: Without dead ends: 3941 [2025-03-09 00:40:06,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-09 00:40:06,066 INFO L435 NwaCegarLoop]: 1928 mSDtfsCounter, 848 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:06,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 4279 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-09 00:40:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-03-09 00:40:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3247. [2025-03-09 00:40:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 2295 states have (on average 1.8753812636165577) internal successors, (4304), 3228 states have internal predecessors, (4304), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4342 transitions. [2025-03-09 00:40:06,115 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4342 transitions. Word has length 10 [2025-03-09 00:40:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:06,115 INFO L471 AbstractCegarLoop]: Abstraction has 3247 states and 4342 transitions. [2025-03-09 00:40:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4342 transitions. [2025-03-09 00:40:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 00:40:06,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:06,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:06,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 00:40:06,317 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-09 00:40:06,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1853675473, now seen corresponding path program 1 times [2025-03-09 00:40:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:06,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123906679] [2025-03-09 00:40:06,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:06,320 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-09 00:40:06,321 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-09 00:40:06,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:40:06,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:40:06,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:06,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:06,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:06,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:06,464 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-09 00:40:06,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:06,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123906679] [2025-03-09 00:40:06,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123906679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:06,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:06,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459115220] [2025-03-09 00:40:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:06,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:06,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:06,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:06,465 INFO L87 Difference]: Start difference. First operand 3247 states and 4342 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:06,533 INFO L93 Difference]: Finished difference Result 3169 states and 4221 transitions. [2025-03-09 00:40:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:40:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 00:40:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:06,543 INFO L225 Difference]: With dead ends: 3169 [2025-03-09 00:40:06,543 INFO L226 Difference]: Without dead ends: 3169 [2025-03-09 00:40:06,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-09 00:40:06,544 INFO L435 NwaCegarLoop]: 2167 mSDtfsCounter, 45 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6478 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:06,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6478 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:40:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-03-09 00:40:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 3163. [2025-03-09 00:40:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3163 states, 2230 states have (on average 1.8730941704035875) internal successors, (4177), 3144 states have internal predecessors, (4177), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4215 transitions. [2025-03-09 00:40:06,596 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4215 transitions. Word has length 11 [2025-03-09 00:40:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:06,596 INFO L471 AbstractCegarLoop]: Abstraction has 3163 states and 4215 transitions. [2025-03-09 00:40:06,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4215 transitions. [2025-03-09 00:40:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:40:06,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:06,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:06,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:40:06,797 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-09 00:40:06,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1072REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1074279377, now seen corresponding path program 1 times [2025-03-09 00:40:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2383694] [2025-03-09 00:40:06,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:06,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:06,800 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-09 00:40:06,801 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-09 00:40:06,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:40:06,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:40:06,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:06,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:06,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:06,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:06,973 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-09 00:40:06,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:06,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2383694] [2025-03-09 00:40:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2383694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:06,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:06,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862021524] [2025-03-09 00:40:06,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:06,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:06,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:06,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:06,974 INFO L87 Difference]: Start difference. First operand 3163 states and 4215 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:09,716 INFO L93 Difference]: Finished difference Result 3838 states and 4935 transitions. [2025-03-09 00:40:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 00:40:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:09,722 INFO L225 Difference]: With dead ends: 3838 [2025-03-09 00:40:09,722 INFO L226 Difference]: Without dead ends: 3838 [2025-03-09 00:40:09,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-09 00:40:09,722 INFO L435 NwaCegarLoop]: 2051 mSDtfsCounter, 1871 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 4246 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-09 00:40:09,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2025-03-09 00:40:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3140. [2025-03-09 00:40:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2230 states have (on average 1.8524663677130044) internal successors, (4131), 3121 states have internal predecessors, (4131), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4169 transitions. [2025-03-09 00:40:09,768 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4169 transitions. Word has length 19 [2025-03-09 00:40:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:09,768 INFO L471 AbstractCegarLoop]: Abstraction has 3140 states and 4169 transitions. [2025-03-09 00:40:09,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4169 transitions. [2025-03-09 00:40:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:40:09,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:09,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:09,776 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-09 00:40:09,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:09,970 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1073REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:09,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1074279378, now seen corresponding path program 1 times [2025-03-09 00:40:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47632515] [2025-03-09 00:40:09,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:09,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:09,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:09,972 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:40:09,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:40:10,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:40:10,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:40:10,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:10,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:10,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:40:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:10,125 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-09 00:40:10,192 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-09 00:40:10,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:10,192 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47632515] [2025-03-09 00:40:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47632515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061485775] [2025-03-09 00:40:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:10,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:10,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:10,193 INFO L87 Difference]: Start difference. First operand 3140 states and 4169 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:14,094 INFO L93 Difference]: Finished difference Result 4571 states and 5912 transitions. [2025-03-09 00:40:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 00:40:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:14,101 INFO L225 Difference]: With dead ends: 4571 [2025-03-09 00:40:14,101 INFO L226 Difference]: Without dead ends: 4571 [2025-03-09 00:40:14,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-09 00:40:14,101 INFO L435 NwaCegarLoop]: 2406 mSDtfsCounter, 1447 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:14,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 5082 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-09 00:40:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2025-03-09 00:40:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 3254. [2025-03-09 00:40:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 2344 states have (on average 1.8212457337883958) internal successors, (4269), 3235 states have internal predecessors, (4269), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4307 transitions. [2025-03-09 00:40:14,128 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4307 transitions. Word has length 19 [2025-03-09 00:40:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:14,128 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 4307 transitions. [2025-03-09 00:40:14,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4307 transitions. [2025-03-09 00:40:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:40:14,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:14,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:40:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:14,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr764REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1055408786, now seen corresponding path program 1 times [2025-03-09 00:40:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022387708] [2025-03-09 00:40:14,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:14,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:14,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:14,333 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-09 00:40:14,334 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-09 00:40:14,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:40:14,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:40:14,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:14,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:14,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:14,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:14,509 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-09 00:40:14,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:14,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022387708] [2025-03-09 00:40:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022387708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691066968] [2025-03-09 00:40:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:14,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:14,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:14,511 INFO L87 Difference]: Start difference. First operand 3254 states and 4307 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:17,086 INFO L93 Difference]: Finished difference Result 3937 states and 4989 transitions. [2025-03-09 00:40:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:17,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 00:40:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:17,092 INFO L225 Difference]: With dead ends: 3937 [2025-03-09 00:40:17,092 INFO L226 Difference]: Without dead ends: 3937 [2025-03-09 00:40:17,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-09 00:40:17,092 INFO L435 NwaCegarLoop]: 2051 mSDtfsCounter, 1848 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 4246 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:17,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 4246 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2680 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-09 00:40:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-09 00:40:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3231. [2025-03-09 00:40:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 2344 states have (on average 1.7819965870307166) internal successors, (4177), 3212 states have internal predecessors, (4177), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 4215 transitions. [2025-03-09 00:40:17,119 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 4215 transitions. Word has length 19 [2025-03-09 00:40:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:17,119 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 4215 transitions. [2025-03-09 00:40:17,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 4215 transitions. [2025-03-09 00:40:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 00:40:17,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:17,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:17,128 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-09 00:40:17,320 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-09 00:40:17,321 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr765REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1055408787, now seen corresponding path program 1 times [2025-03-09 00:40:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981001251] [2025-03-09 00:40:17,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:17,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:17,324 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-09 00:40:17,327 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-09 00:40:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 00:40:17,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 00:40:17,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:17,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:17,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:40:17,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:17,497 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-09 00:40:17,549 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-09 00:40:17,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:17,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:17,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981001251] [2025-03-09 00:40:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981001251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:17,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268799844] [2025-03-09 00:40:17,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:17,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:17,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:17,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:17,550 INFO L87 Difference]: Start difference. First operand 3231 states and 4215 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:21,482 INFO L93 Difference]: Finished difference Result 4639 states and 5958 transitions. [2025-03-09 00:40:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 00:40:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:21,490 INFO L225 Difference]: With dead ends: 4639 [2025-03-09 00:40:21,490 INFO L226 Difference]: Without dead ends: 4639 [2025-03-09 00:40:21,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-09 00:40:21,491 INFO L435 NwaCegarLoop]: 2376 mSDtfsCounter, 1424 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 5006 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:21,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 5006 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-09 00:40:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2025-03-09 00:40:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 3345. [2025-03-09 00:40:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 2458 states have (on average 1.7554922701383238) internal successors, (4315), 3326 states have internal predecessors, (4315), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4353 transitions. [2025-03-09 00:40:21,526 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 4353 transitions. Word has length 19 [2025-03-09 00:40:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:21,527 INFO L471 AbstractCegarLoop]: Abstraction has 3345 states and 4353 transitions. [2025-03-09 00:40:21,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 4353 transitions. [2025-03-09 00:40:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 00:40:21,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:21,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:21,539 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-09 00:40:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:21,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1073REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1872362321, now seen corresponding path program 1 times [2025-03-09 00:40:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808332202] [2025-03-09 00:40:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:21,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:21,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:21,734 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:40:21,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:40:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 00:40:21,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 00:40:21,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:21,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:40:21,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:21,947 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-09 00:40:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:40:22,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:40:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:40:22,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808332202] [2025-03-09 00:40:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808332202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:40:22,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:40:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:40:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345186385] [2025-03-09 00:40:22,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:40:22,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:40:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:22,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:40:22,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:40:22,423 INFO L87 Difference]: Start difference. First operand 3345 states and 4353 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:33,106 INFO L93 Difference]: Finished difference Result 5026 states and 6488 transitions. [2025-03-09 00:40:33,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 00:40:33,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-09 00:40:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:33,111 INFO L225 Difference]: With dead ends: 5026 [2025-03-09 00:40:33,111 INFO L226 Difference]: Without dead ends: 5026 [2025-03-09 00:40:33,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:40:33,112 INFO L435 NwaCegarLoop]: 2384 mSDtfsCounter, 3669 mSDsluCounter, 5883 mSDsCounter, 0 mSdLazyCounter, 5672 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3675 SdHoareTripleChecker+Valid, 8267 SdHoareTripleChecker+Invalid, 5704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:33,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3675 Valid, 8267 Invalid, 5704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5672 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-03-09 00:40:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2025-03-09 00:40:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 3509. [2025-03-09 00:40:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 2622 states have (on average 1.7341723874904653) internal successors, (4547), 3490 states have internal predecessors, (4547), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 4585 transitions. [2025-03-09 00:40:33,146 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 4585 transitions. Word has length 38 [2025-03-09 00:40:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:33,146 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 4585 transitions. [2025-03-09 00:40:33,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 4585 transitions. [2025-03-09 00:40:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 00:40:33,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:33,147 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:33,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 00:40:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:33,348 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr765REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:33,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1339764787, now seen corresponding path program 1 times [2025-03-09 00:40:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397414069] [2025-03-09 00:40:33,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:33,351 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-09 00:40:33,353 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-09 00:40:33,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 00:40:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 00:40:33,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:33,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:33,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:40:33,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:33,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 5 [2025-03-09 00:40:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:40:33,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:40:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:40:34,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:34,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397414069] [2025-03-09 00:40:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397414069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:40:34,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:40:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 00:40:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621394164] [2025-03-09 00:40:34,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:40:34,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 00:40:34,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:34,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 00:40:34,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 00:40:34,004 INFO L87 Difference]: Start difference. First operand 3509 states and 4585 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:44,771 INFO L93 Difference]: Finished difference Result 5190 states and 6720 transitions. [2025-03-09 00:40:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:40:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-09 00:40:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:44,776 INFO L225 Difference]: With dead ends: 5190 [2025-03-09 00:40:44,776 INFO L226 Difference]: Without dead ends: 5190 [2025-03-09 00:40:44,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:40:44,777 INFO L435 NwaCegarLoop]: 2377 mSDtfsCounter, 2045 mSDsluCounter, 6880 mSDsCounter, 0 mSdLazyCounter, 6575 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 9257 SdHoareTripleChecker+Invalid, 6604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 9257 Invalid, 6604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6575 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2025-03-09 00:40:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2025-03-09 00:40:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 3673. [2025-03-09 00:40:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 2786 states have (on average 1.7153625269203159) internal successors, (4779), 3654 states have internal predecessors, (4779), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 00:40:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4817 transitions. [2025-03-09 00:40:44,811 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4817 transitions. Word has length 38 [2025-03-09 00:40:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:44,811 INFO L471 AbstractCegarLoop]: Abstraction has 3673 states and 4817 transitions. [2025-03-09 00:40:44,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4817 transitions. [2025-03-09 00:40:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 00:40:44,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:44,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:44,822 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-09 00:40:45,012 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-09 00:40:45,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:45,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1828640678, now seen corresponding path program 1 times [2025-03-09 00:40:45,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829945967] [2025-03-09 00:40:45,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:45,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:45,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:45,016 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-09 00:40:45,018 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-09 00:40:45,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 00:40:45,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 00:40:45,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:45,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:45,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:45,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:45,290 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-09 00:40:45,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:45,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829945967] [2025-03-09 00:40:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829945967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:45,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919238378] [2025-03-09 00:40:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:40:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:45,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:40:45,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:40:45,291 INFO L87 Difference]: Start difference. First operand 3673 states and 4817 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:45,447 INFO L93 Difference]: Finished difference Result 5242 states and 6499 transitions. [2025-03-09 00:40:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:40:45,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-09 00:40:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:45,452 INFO L225 Difference]: With dead ends: 5242 [2025-03-09 00:40:45,452 INFO L226 Difference]: Without dead ends: 5242 [2025-03-09 00:40:45,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:40:45,453 INFO L435 NwaCegarLoop]: 2211 mSDtfsCounter, 1432 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:45,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 4252 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:40:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-03-09 00:40:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 4380. [2025-03-09 00:40:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3489 states have (on average 1.706792777300086) internal successors, (5955), 4354 states have internal predecessors, (5955), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-09 00:40:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 6007 transitions. [2025-03-09 00:40:45,498 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 6007 transitions. Word has length 39 [2025-03-09 00:40:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 4380 states and 6007 transitions. [2025-03-09 00:40:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 6007 transitions. [2025-03-09 00:40:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:40:45,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:45,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:45,511 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-09 00:40:45,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:45,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1641912525, now seen corresponding path program 1 times [2025-03-09 00:40:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:45,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053899625] [2025-03-09 00:40:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:45,705 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:40:45,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 00:40:45,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:40:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:40:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:45,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:45,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:45,919 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-09 00:40:45,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:45,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:45,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053899625] [2025-03-09 00:40:45,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053899625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:45,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:45,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366423156] [2025-03-09 00:40:45,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:45,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:45,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:45,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:45,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:45,920 INFO L87 Difference]: Start difference. First operand 4380 states and 6007 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:45,983 INFO L93 Difference]: Finished difference Result 4362 states and 5973 transitions. [2025-03-09 00:40:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:40:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-09 00:40:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:45,989 INFO L225 Difference]: With dead ends: 4362 [2025-03-09 00:40:45,989 INFO L226 Difference]: Without dead ends: 4362 [2025-03-09 00:40:45,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:40:45,990 INFO L435 NwaCegarLoop]: 2123 mSDtfsCounter, 27 mSDsluCounter, 4209 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6332 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:45,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6332 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:40:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2025-03-09 00:40:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 4362. [2025-03-09 00:40:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4362 states, 3471 states have (on average 1.7058484586574474) internal successors, (5921), 4336 states have internal predecessors, (5921), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-09 00:40:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 5973 transitions. [2025-03-09 00:40:46,028 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 5973 transitions. Word has length 50 [2025-03-09 00:40:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:46,028 INFO L471 AbstractCegarLoop]: Abstraction has 4362 states and 5973 transitions. [2025-03-09 00:40:46,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 5973 transitions. [2025-03-09 00:40:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 00:40:46,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:46,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:46,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 00:40:46,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:46,230 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr712REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:46,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:46,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1253368553, now seen corresponding path program 1 times [2025-03-09 00:40:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:46,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481994996] [2025-03-09 00:40:46,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:46,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:46,233 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-09 00:40:46,234 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-09 00:40:46,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 00:40:46,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 00:40:46,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:46,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:46,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:46,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:46,609 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-09 00:40:46,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:46,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481994996] [2025-03-09 00:40:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481994996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:46,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606304358] [2025-03-09 00:40:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:46,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:40:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:40:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:40:46,610 INFO L87 Difference]: Start difference. First operand 4362 states and 5973 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:46,705 INFO L93 Difference]: Finished difference Result 5720 states and 7424 transitions. [2025-03-09 00:40:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:40:46,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-09 00:40:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:46,711 INFO L225 Difference]: With dead ends: 5720 [2025-03-09 00:40:46,711 INFO L226 Difference]: Without dead ends: 5720 [2025-03-09 00:40:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:40:46,711 INFO L435 NwaCegarLoop]: 2219 mSDtfsCounter, 1315 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:46,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 4294 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 00:40:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2025-03-09 00:40:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5094. [2025-03-09 00:40:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5094 states, 4199 states have (on average 1.698023338890212) internal successors, (7130), 5061 states have internal predecessors, (7130), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 00:40:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5094 states to 5094 states and 7196 transitions. [2025-03-09 00:40:46,757 INFO L78 Accepts]: Start accepts. Automaton has 5094 states and 7196 transitions. Word has length 50 [2025-03-09 00:40:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:46,757 INFO L471 AbstractCegarLoop]: Abstraction has 5094 states and 7196 transitions. [2025-03-09 00:40:46,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5094 states and 7196 transitions. [2025-03-09 00:40:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:40:46,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:46,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:46,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 00:40:46,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:46,959 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr991REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -583575815, now seen corresponding path program 1 times [2025-03-09 00:40:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444197283] [2025-03-09 00:40:46,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:46,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:46,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:46,962 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:40:46,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 00:40:47,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:40:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:40:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:47,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:47,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:47,219 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-09 00:40:47,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:47,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444197283] [2025-03-09 00:40:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444197283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600634748] [2025-03-09 00:40:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:47,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:47,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:47,221 INFO L87 Difference]: Start difference. First operand 5094 states and 7196 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:47,291 INFO L93 Difference]: Finished difference Result 4639 states and 6542 transitions. [2025-03-09 00:40:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:40:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-09 00:40:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:47,297 INFO L225 Difference]: With dead ends: 4639 [2025-03-09 00:40:47,298 INFO L226 Difference]: Without dead ends: 4639 [2025-03-09 00:40:47,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-09 00:40:47,298 INFO L435 NwaCegarLoop]: 2077 mSDtfsCounter, 56 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6158 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:47,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6158 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:40:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2025-03-09 00:40:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 4636. [2025-03-09 00:40:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 3764 states have (on average 1.7197130712008502) internal successors, (6473), 4603 states have internal predecessors, (6473), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 00:40:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6539 transitions. [2025-03-09 00:40:47,364 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6539 transitions. Word has length 53 [2025-03-09 00:40:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:47,364 INFO L471 AbstractCegarLoop]: Abstraction has 4636 states and 6539 transitions. [2025-03-09 00:40:47,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6539 transitions. [2025-03-09 00:40:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 00:40:47,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:47,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:47,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 00:40:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:47,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr683REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:47,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1343758566, now seen corresponding path program 1 times [2025-03-09 00:40:47,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:47,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527155704] [2025-03-09 00:40:47,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:47,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:47,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:47,568 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-09 00:40:47,569 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-09 00:40:47,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 00:40:47,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 00:40:47,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:47,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:47,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:40:47,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:47,804 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-09 00:40:47,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:47,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527155704] [2025-03-09 00:40:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527155704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74856586] [2025-03-09 00:40:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:47,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:47,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:47,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:47,805 INFO L87 Difference]: Start difference. First operand 4636 states and 6539 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:47,860 INFO L93 Difference]: Finished difference Result 4172 states and 5797 transitions. [2025-03-09 00:40:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:40:47,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-09 00:40:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:47,864 INFO L225 Difference]: With dead ends: 4172 [2025-03-09 00:40:47,864 INFO L226 Difference]: Without dead ends: 4172 [2025-03-09 00:40:47,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-09 00:40:47,865 INFO L435 NwaCegarLoop]: 2042 mSDtfsCounter, 76 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:47,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 6033 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 00:40:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-03-09 00:40:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4165. [2025-03-09 00:40:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 3305 states have (on average 1.7319213313161876) internal successors, (5724), 4132 states have internal predecessors, (5724), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 00:40:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5790 transitions. [2025-03-09 00:40:47,924 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5790 transitions. Word has length 53 [2025-03-09 00:40:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:47,924 INFO L471 AbstractCegarLoop]: Abstraction has 4165 states and 5790 transitions. [2025-03-09 00:40:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5790 transitions. [2025-03-09 00:40:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 00:40:47,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:47,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:47,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-09 00:40:48,125 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-09 00:40:48,126 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:48,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 95401477, now seen corresponding path program 1 times [2025-03-09 00:40:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:48,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940390703] [2025-03-09 00:40:48,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:48,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:48,129 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-09 00:40:48,130 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-09 00:40:48,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 00:40:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 00:40:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:48,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 00:40:48,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:48,309 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:40:48,310 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:40:48,310 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 00:40:48,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-09 00:40:48,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 00:40:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-09 00:40:48,358 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-09 00:40:48,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:48,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940390703] [2025-03-09 00:40:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940390703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231107849] [2025-03-09 00:40:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:48,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:48,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:48,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:48,359 INFO L87 Difference]: Start difference. First operand 4165 states and 5790 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:48,811 INFO L93 Difference]: Finished difference Result 4736 states and 6278 transitions. [2025-03-09 00:40:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-09 00:40:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:48,816 INFO L225 Difference]: With dead ends: 4736 [2025-03-09 00:40:48,816 INFO L226 Difference]: Without dead ends: 4736 [2025-03-09 00:40:48,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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-09 00:40:48,816 INFO L435 NwaCegarLoop]: 2261 mSDtfsCounter, 911 mSDsluCounter, 4191 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 6452 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:48,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 6452 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 00:40:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2025-03-09 00:40:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 3885. [2025-03-09 00:40:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 3028 states have (on average 1.7410832232496698) internal successors, (5272), 3855 states have internal predecessors, (5272), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 00:40:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5332 transitions. [2025-03-09 00:40:48,857 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5332 transitions. Word has length 58 [2025-03-09 00:40:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:48,858 INFO L471 AbstractCegarLoop]: Abstraction has 3885 states and 5332 transitions. [2025-03-09 00:40:48,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5332 transitions. [2025-03-09 00:40:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 00:40:48,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:48,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:48,867 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-09 00:40:49,059 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-09 00:40:49,059 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr991REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1816994225, now seen corresponding path program 1 times [2025-03-09 00:40:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735363260] [2025-03-09 00:40:49,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:49,062 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-09 00:40:49,063 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-09 00:40:49,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 00:40:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 00:40:49,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:49,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 00:40:49,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:49,298 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-09 00:40:49,302 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-09 00:40:49,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 00:40:49,624 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-09 00:40:49,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-09 00:40:49,631 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-09 00:40:49,643 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-09 00:40:49,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:49,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735363260] [2025-03-09 00:40:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735363260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:49,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:40:49,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137753086] [2025-03-09 00:40:49,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:49,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:40:49,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:49,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:40:49,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:49,644 INFO L87 Difference]: Start difference. First operand 3885 states and 5332 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:51,864 INFO L93 Difference]: Finished difference Result 3801 states and 5144 transitions. [2025-03-09 00:40:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:40:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-09 00:40:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:51,869 INFO L225 Difference]: With dead ends: 3801 [2025-03-09 00:40:51,869 INFO L226 Difference]: Without dead ends: 3801 [2025-03-09 00:40:51,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:40:51,869 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 3286 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:51,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 1011 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-09 00:40:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2025-03-09 00:40:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3694. [2025-03-09 00:40:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 2921 states have (on average 1.671345429647381) internal successors, (4882), 3664 states have internal predecessors, (4882), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 00:40:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4942 transitions. [2025-03-09 00:40:51,903 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4942 transitions. Word has length 61 [2025-03-09 00:40:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:51,903 INFO L471 AbstractCegarLoop]: Abstraction has 3694 states and 4942 transitions. [2025-03-09 00:40:51,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4942 transitions. [2025-03-09 00:40:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 00:40:51,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:51,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:51,914 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-09 00:40:52,104 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 [2025-03-09 00:40:52,104 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr984REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:52,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 981506817, now seen corresponding path program 1 times [2025-03-09 00:40:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:52,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197848653] [2025-03-09 00:40:52,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:52,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:52,109 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:40:52,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 00:40:52,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 00:40:52,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 00:40:52,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:52,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:52,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:40:52,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:52,348 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-09 00:40:52,357 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 19 treesize of output 1 [2025-03-09 00:40:52,373 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-09 00:40:52,379 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-09 00:40:52,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:52,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197848653] [2025-03-09 00:40:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197848653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209291247] [2025-03-09 00:40:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:40:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:52,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:40:52,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:40:52,381 INFO L87 Difference]: Start difference. First operand 3694 states and 4942 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:54,955 INFO L93 Difference]: Finished difference Result 3693 states and 4940 transitions. [2025-03-09 00:40:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:40:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-09 00:40:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:54,958 INFO L225 Difference]: With dead ends: 3693 [2025-03-09 00:40:54,958 INFO L226 Difference]: Without dead ends: 3693 [2025-03-09 00:40:54,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:40:54,960 INFO L435 NwaCegarLoop]: 1968 mSDtfsCounter, 2 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5284 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:54,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5284 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-09 00:40:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2025-03-09 00:40:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 3693. [2025-03-09 00:40:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 2921 states have (on average 1.6706607326258132) internal successors, (4880), 3663 states have internal predecessors, (4880), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 00:40:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 4940 transitions. [2025-03-09 00:40:54,985 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 4940 transitions. Word has length 66 [2025-03-09 00:40:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:54,985 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 4940 transitions. [2025-03-09 00:40:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 4940 transitions. [2025-03-09 00:40:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 00:40:54,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:54,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:54,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 00:40:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:55,187 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr985REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:55,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash 981506818, now seen corresponding path program 1 times [2025-03-09 00:40:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:55,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491854750] [2025-03-09 00:40:55,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:55,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:55,189 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-09 00:40:55,190 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-09 00:40:55,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 00:40:55,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 00:40:55,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:55,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:55,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:40:55,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:55,419 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-09 00:40:55,431 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 19 treesize of output 1 [2025-03-09 00:40:55,437 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 13 treesize of output 9 [2025-03-09 00:40:55,461 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 21 treesize of output 9 [2025-03-09 00:40:55,472 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-09 00:40:55,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:55,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491854750] [2025-03-09 00:40:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491854750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232756289] [2025-03-09 00:40:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:55,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:40:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:55,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:40:55,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:40:55,473 INFO L87 Difference]: Start difference. First operand 3693 states and 4940 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:40:58,948 INFO L93 Difference]: Finished difference Result 3692 states and 4938 transitions. [2025-03-09 00:40:58,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:40:58,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-09 00:40:58,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:40:58,952 INFO L225 Difference]: With dead ends: 3692 [2025-03-09 00:40:58,952 INFO L226 Difference]: Without dead ends: 3692 [2025-03-09 00:40:58,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:40:58,953 INFO L435 NwaCegarLoop]: 1968 mSDtfsCounter, 1 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5228 SdHoareTripleChecker+Invalid, 2649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-09 00:40:58,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5228 Invalid, 2649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-09 00:40:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-03-09 00:40:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3692. [2025-03-09 00:40:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2919 states have (on average 1.671120246659815) internal successors, (4878), 3662 states have internal predecessors, (4878), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 00:40:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4938 transitions. [2025-03-09 00:40:58,991 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 4938 transitions. Word has length 66 [2025-03-09 00:40:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:40:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 4938 transitions. [2025-03-09 00:40:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:40:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 4938 transitions. [2025-03-09 00:40:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 00:40:58,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:40:58,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:40:59,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-09 00:40:59,192 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-09 00:40:59,193 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:40:59,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:40:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1563967427, now seen corresponding path program 1 times [2025-03-09 00:40:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:40:59,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024493886] [2025-03-09 00:40:59,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:40:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:40:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:40:59,195 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-09 00:40:59,196 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-09 00:40:59,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 00:40:59,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 00:40:59,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:40:59,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:40:59,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 00:40:59,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:40:59,425 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-09 00:40:59,432 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 19 treesize of output 1 [2025-03-09 00:40:59,445 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-09 00:40:59,451 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-09 00:40:59,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:40:59,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:40:59,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024493886] [2025-03-09 00:40:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024493886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:40:59,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:40:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:40:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600368933] [2025-03-09 00:40:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:40:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:40:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:40:59,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:40:59,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:40:59,452 INFO L87 Difference]: Start difference. First operand 3692 states and 4938 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:41:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 00:41:02,042 INFO L93 Difference]: Finished difference Result 3691 states and 4935 transitions. [2025-03-09 00:41:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:41:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-09 00:41:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 00:41:02,046 INFO L225 Difference]: With dead ends: 3691 [2025-03-09 00:41:02,046 INFO L226 Difference]: Without dead ends: 3691 [2025-03-09 00:41:02,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:41:02,046 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 2 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-09 00:41:02,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5279 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-09 00:41:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2025-03-09 00:41:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2025-03-09 00:41:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2919 states have (on average 1.6700924974306268) internal successors, (4875), 3661 states have internal predecessors, (4875), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-09 00:41:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4935 transitions. [2025-03-09 00:41:02,069 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4935 transitions. Word has length 66 [2025-03-09 00:41:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 00:41:02,069 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 4935 transitions. [2025-03-09 00:41:02,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:41:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4935 transitions. [2025-03-09 00:41:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 00:41:02,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 00:41:02,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:41:02,079 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-09 00:41:02,270 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-09 00:41:02,270 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1088 more)] === [2025-03-09 00:41:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:41:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1563967426, now seen corresponding path program 1 times [2025-03-09 00:41:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:41:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74129008] [2025-03-09 00:41:02,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:41:02,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:41:02,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:41:02,273 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-09 00:41:02,274 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-09 00:41:02,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 00:41:02,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 00:41:02,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:41:02,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:41:02,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:41:02,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:41:02,525 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-09 00:41:02,545 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 19 treesize of output 1 [2025-03-09 00:41:02,549 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 13 treesize of output 9 [2025-03-09 00:41:02,581 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 21 treesize of output 9 [2025-03-09 00:41:02,593 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-09 00:41:02,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:41:02,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:41:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74129008] [2025-03-09 00:41:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74129008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:41:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:41:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:41:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931817902] [2025-03-09 00:41:02,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:41:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:41:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:41:02,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:41:02,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:41:02,594 INFO L87 Difference]: Start difference. First operand 3691 states and 4935 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)