./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:07:32,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:07:32,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:07:32,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:07:32,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:07:32,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:07:32,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:07:32,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:07:32,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:07:32,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:07:32,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:07:32,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:07:32,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:07:32,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:07:32,907 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:07:32,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:07:32,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:32,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:32,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:32,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:07:32,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:07:32,909 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-01-10 00:07:33,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:07:33,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:07:33,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:07:33,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:07:33,147 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:07:33,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-01-10 00:07:34,340 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbaaf2d7/c2ee51f6bc9e4a149188be3d5f389a4b/FLAG6a7f27a78 [2025-01-10 00:07:34,788 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:07:34,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-01-10 00:07:34,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbaaf2d7/c2ee51f6bc9e4a149188be3d5f389a4b/FLAG6a7f27a78 [2025-01-10 00:07:34,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbaaf2d7/c2ee51f6bc9e4a149188be3d5f389a4b [2025-01-10 00:07:34,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:07:34,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:07:34,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:34,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:07:34,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:07:34,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:34" (1/1) ... [2025-01-10 00:07:34,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294a2e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:34, skipping insertion in model container [2025-01-10 00:07:34,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:34" (1/1) ... [2025-01-10 00:07:34,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:07:35,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-01-10 00:07:35,678 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,691 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,701 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,704 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,706 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,707 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,715 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,715 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,717 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,731 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,734 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,743 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,759 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,762 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,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-01-10 00:07:35,779 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,785 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:35,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:35,827 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:07:35,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:36,104 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:07:36,115 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:07:36,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36 WrapperNode [2025-01-10 00:07:36,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:36,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:36,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:07:36,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:07:36,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,262 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1858 [2025-01-10 00:07:36,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:36,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:07:36,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:07:36,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:07:36,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,290 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:07:36,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:07:36,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:07:36,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:07:36,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:07:36,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (1/1) ... [2025-01-10 00:07:36,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:36,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:07:36,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:07:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-10 00:07:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-01-10 00:07:36,449 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-01-10 00:07:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:07:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-10 00:07:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-01-10 00:07:36,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-01-10 00:07:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:07:36,450 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 00:07:36,450 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-01-10 00:07:36,451 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-01-10 00:07:36,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:07:36,452 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-01-10 00:07:36,452 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-01-10 00:07:36,841 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:07:36,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:07:43,540 INFO L? ?]: Removed 1346 outVars from TransFormulas that were not future-live. [2025-01-10 00:07:43,540 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:07:43,575 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:07:43,576 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 00:07:43,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:43 BoogieIcfgContainer [2025-01-10 00:07:43,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:07:43,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:07:43,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:07:43,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:07:43,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:07:34" (1/3) ... [2025-01-10 00:07:43,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aae3513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:43, skipping insertion in model container [2025-01-10 00:07:43,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:36" (2/3) ... [2025-01-10 00:07:43,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aae3513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:43, skipping insertion in model container [2025-01-10 00:07:43,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:43" (3/3) ... [2025-01-10 00:07:43,586 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-01-10 00:07:43,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:07:43,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 1217 locations, 1 initial locations, 23 loop locations, and 494 error locations. [2025-01-10 00:07:43,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:07:43,676 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;@5569cf2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:07:43,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 494 error locations. [2025-01-10 00:07:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 1217 states, 656 states have (on average 2.019817073170732) internal successors, (1325), 1165 states have internal predecessors, (1325), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-10 00:07:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:43,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:43,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:43,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:07:43,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1269121, now seen corresponding path program 1 times [2025-01-10 00:07:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161588773] [2025-01-10 00:07:43,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:43,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:44,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:44,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:44,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:44,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161588773] [2025-01-10 00:07:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161588773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:45,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:45,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857408170] [2025-01-10 00:07:45,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:45,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:45,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:45,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:45,185 INFO L87 Difference]: Start difference. First operand has 1217 states, 656 states have (on average 2.019817073170732) internal successors, (1325), 1165 states have internal predecessors, (1325), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) 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-01-10 00:07:49,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:51,170 INFO L93 Difference]: Finished difference Result 1368 states and 1563 transitions. [2025-01-10 00:07:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:51,175 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-01-10 00:07:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:51,185 INFO L225 Difference]: With dead ends: 1368 [2025-01-10 00:07:51,186 INFO L226 Difference]: Without dead ends: 1366 [2025-01-10 00:07:51,186 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-01-10 00:07:51,188 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 441 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:51,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1626 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 655 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-01-10 00:07:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-01-10 00:07:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1037. [2025-01-10 00:07:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 559 states have (on average 1.9838998211091234) internal successors, (1109), 990 states have internal predecessors, (1109), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:07:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-01-10 00:07:51,253 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 3 [2025-01-10 00:07:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:51,253 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-01-10 00:07:51,253 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-01-10 00:07:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-01-10 00:07:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:51,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:51,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:07:51,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:07:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1269122, now seen corresponding path program 1 times [2025-01-10 00:07:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485837469] [2025-01-10 00:07:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:51,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:51,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:51,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485837469] [2025-01-10 00:07:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485837469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:52,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927760849] [2025-01-10 00:07:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:52,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:52,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:52,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:52,247 INFO L87 Difference]: Start difference. First operand 1037 states and 1191 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-01-10 00:07:56,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:57,621 INFO L93 Difference]: Finished difference Result 1036 states and 1190 transitions. [2025-01-10 00:07:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:57,622 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-01-10 00:07:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:57,626 INFO L225 Difference]: With dead ends: 1036 [2025-01-10 00:07:57,627 INFO L226 Difference]: Without dead ends: 1036 [2025-01-10 00:07:57,627 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-01-10 00:07:57,628 INFO L435 NwaCegarLoop]: 1183 mSDtfsCounter, 10 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:57,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1940 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-01-10 00:07:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-01-10 00:07:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2025-01-10 00:07:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 559 states have (on average 1.9821109123434706) internal successors, (1108), 989 states have internal predecessors, (1108), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:07:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1190 transitions. [2025-01-10 00:07:57,668 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1190 transitions. Word has length 3 [2025-01-10 00:07:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:57,668 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1190 transitions. [2025-01-10 00:07:57,668 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-01-10 00:07:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1190 transitions. [2025-01-10 00:07:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:07:57,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:57,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:07:57,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:07:57,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:07:57,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -845106200, now seen corresponding path program 1 times [2025-01-10 00:07:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941075941] [2025-01-10 00:07:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:58,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:07:58,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:07:58,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:58,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941075941] [2025-01-10 00:07:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941075941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:58,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:58,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:58,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234761693] [2025-01-10 00:07:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:58,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:58,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:58,321 INFO L87 Difference]: Start difference. First operand 1036 states and 1190 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-10 00:07:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:58,378 INFO L93 Difference]: Finished difference Result 1039 states and 1194 transitions. [2025-01-10 00:07:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-01-10 00:07:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:58,383 INFO L225 Difference]: With dead ends: 1039 [2025-01-10 00:07:58,383 INFO L226 Difference]: Without dead ends: 1039 [2025-01-10 00:07:58,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-10 00:07:58,384 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 2 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:58,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2369 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-01-10 00:07:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1037. [2025-01-10 00:07:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 560 states have (on average 1.980357142857143) internal successors, (1109), 990 states have internal predecessors, (1109), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:07:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1191 transitions. [2025-01-10 00:07:58,406 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1191 transitions. Word has length 6 [2025-01-10 00:07:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1191 transitions. [2025-01-10 00:07:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-01-10 00:07:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1191 transitions. [2025-01-10 00:07:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:07:58,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:58,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:07:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:07:58,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:07:58,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash -845106391, now seen corresponding path program 1 times [2025-01-10 00:07:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016953736] [2025-01-10 00:07:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:58,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:07:58,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:07:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:59,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:59,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016953736] [2025-01-10 00:07:59,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016953736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:59,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:59,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805964473] [2025-01-10 00:07:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:59,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:07:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:59,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:07:59,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:59,571 INFO L87 Difference]: Start difference. First operand 1037 states and 1191 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-01-10 00:08:03,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:07,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:11,592 INFO L93 Difference]: Finished difference Result 1039 states and 1193 transitions. [2025-01-10 00:08:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:08:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-01-10 00:08:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:11,598 INFO L225 Difference]: With dead ends: 1039 [2025-01-10 00:08:11,599 INFO L226 Difference]: Without dead ends: 1039 [2025-01-10 00:08:11,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-10 00:08:11,599 INFO L435 NwaCegarLoop]: 1181 mSDtfsCounter, 10 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:11,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2697 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 858 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2025-01-10 00:08:11,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2025-01-10 00:08:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1038. [2025-01-10 00:08:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 561 states have (on average 1.9786096256684491) internal successors, (1110), 991 states have internal predecessors, (1110), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:08:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1192 transitions. [2025-01-10 00:08:11,623 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1192 transitions. Word has length 6 [2025-01-10 00:08:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1192 transitions. [2025-01-10 00:08:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-01-10 00:08:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1192 transitions. [2025-01-10 00:08:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:11,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:11,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:08:11,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:08:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 534988521, now seen corresponding path program 1 times [2025-01-10 00:08:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730793337] [2025-01-10 00:08:11,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:12,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:12,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:12,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:12,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730793337] [2025-01-10 00:08:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730793337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390768766] [2025-01-10 00:08:12,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:12,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:12,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:12,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:12,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:08:13,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:13,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:13,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:13,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:13,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:08:13,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:13,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390768766] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:13,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:08:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373559098] [2025-01-10 00:08:13,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:13,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:13,442 INFO L87 Difference]: Start difference. First operand 1038 states and 1192 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-01-10 00:08:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:13,527 INFO L93 Difference]: Finished difference Result 1046 states and 1202 transitions. [2025-01-10 00:08:13,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:13,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 9 [2025-01-10 00:08:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:13,531 INFO L225 Difference]: With dead ends: 1046 [2025-01-10 00:08:13,531 INFO L226 Difference]: Without dead ends: 1046 [2025-01-10 00:08:13,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:13,532 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 4 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:13,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2369 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-01-10 00:08:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-01-10 00:08:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 569 states have (on average 1.968365553602812) internal successors, (1120), 999 states have internal predecessors, (1120), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:08:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1202 transitions. [2025-01-10 00:08:13,553 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1202 transitions. Word has length 9 [2025-01-10 00:08:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:13,553 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1202 transitions. [2025-01-10 00:08:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-01-10 00:08:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1202 transitions. [2025-01-10 00:08:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:08:13,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:13,554 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:13,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:08:13,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:13,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:08:13,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash 534988330, now seen corresponding path program 1 times [2025-01-10 00:08:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962020154] [2025-01-10 00:08:13,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:14,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:14,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962020154] [2025-01-10 00:08:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962020154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380749216] [2025-01-10 00:08:14,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:14,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:14,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:08:15,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:08:15,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:08:15,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:15,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:08:15,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:16,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:16,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-10 00:08:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380749216] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:16,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:08:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975153443] [2025-01-10 00:08:16,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:08:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:16,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:08:16,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:08:16,375 INFO L87 Difference]: Start difference. First operand 1046 states and 1202 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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-01-10 00:08:20,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:24,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:28,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:32,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:36,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:40,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:44,546 INFO L93 Difference]: Finished difference Result 1045 states and 1199 transitions. [2025-01-10 00:08:44,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:08:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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 9 [2025-01-10 00:08:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:44,550 INFO L225 Difference]: With dead ends: 1045 [2025-01-10 00:08:44,550 INFO L226 Difference]: Without dead ends: 1045 [2025-01-10 00:08:44,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:08:44,551 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 547 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 4714 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:44,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 4714 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1343 Invalid, 6 Unknown, 0 Unchecked, 28.0s Time] [2025-01-10 00:08:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-01-10 00:08:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1045. [2025-01-10 00:08:44,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 569 states have (on average 1.9630931458699472) internal successors, (1117), 998 states have internal predecessors, (1117), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:08:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1199 transitions. [2025-01-10 00:08:44,571 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1199 transitions. Word has length 9 [2025-01-10 00:08:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1199 transitions. [2025-01-10 00:08:44,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 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-01-10 00:08:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1199 transitions. [2025-01-10 00:08:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:08:44,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:44,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:44,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:08:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:44,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:08:44,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1960897368, now seen corresponding path program 2 times [2025-01-10 00:08:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947617248] [2025-01-10 00:08:44,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:45,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 00:08:45,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 00:08:45,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:08:45,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 00:08:45,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:45,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947617248] [2025-01-10 00:08:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947617248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:45,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:45,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:08:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171485059] [2025-01-10 00:08:45,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:45,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:08:45,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:45,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:08:45,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:45,688 INFO L87 Difference]: Start difference. First operand 1045 states and 1199 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-01-10 00:08:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:48,804 INFO L93 Difference]: Finished difference Result 1832 states and 2120 transitions. [2025-01-10 00:08:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 18 [2025-01-10 00:08:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:48,813 INFO L225 Difference]: With dead ends: 1832 [2025-01-10 00:08:48,817 INFO L226 Difference]: Without dead ends: 1832 [2025-01-10 00:08:48,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:48,818 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 989 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:48,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 2781 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-10 00:08:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-01-10 00:08:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1044. [2025-01-10 00:08:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 569 states have (on average 1.961335676625659) internal successors, (1116), 997 states have internal predecessors, (1116), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:08:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1198 transitions. [2025-01-10 00:08:48,883 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1198 transitions. Word has length 18 [2025-01-10 00:08:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1198 transitions. [2025-01-10 00:08:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-01-10 00:08:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1198 transitions. [2025-01-10 00:08:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:08:48,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:48,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:48,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:08:48,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:08:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1960897367, now seen corresponding path program 1 times [2025-01-10 00:08:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714641971] [2025-01-10 00:08:48,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:49,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:49,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:49,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:49,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:49,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714641971] [2025-01-10 00:08:49,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714641971] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:49,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239293207] [2025-01-10 00:08:49,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:49,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:08:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:50,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:50,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:50,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:50,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:08:50,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:50,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239293207] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:50,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:08:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551778063] [2025-01-10 00:08:50,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:50,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:08:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:50,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:08:50,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:08:50,859 INFO L87 Difference]: Start difference. First operand 1044 states and 1198 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-01-10 00:08:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:50,944 INFO L93 Difference]: Finished difference Result 1062 states and 1216 transitions. [2025-01-10 00:08:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:08:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 18 [2025-01-10 00:08:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:50,952 INFO L225 Difference]: With dead ends: 1062 [2025-01-10 00:08:50,953 INFO L226 Difference]: Without dead ends: 1062 [2025-01-10 00:08:50,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:08:50,953 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 4 mSDsluCounter, 4728 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5913 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:50,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5913 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-01-10 00:08:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-01-10 00:08:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 587 states have (on average 1.9318568994889267) internal successors, (1134), 1015 states have internal predecessors, (1134), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-10 00:08:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1216 transitions. [2025-01-10 00:08:50,997 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1216 transitions. Word has length 18 [2025-01-10 00:08:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:51,001 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1216 transitions. [2025-01-10 00:08:51,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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-01-10 00:08:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1216 transitions. [2025-01-10 00:08:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:08:51,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:51,003 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:51,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:08:51,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:51,204 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:08:51,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1182348855, now seen corresponding path program 2 times [2025-01-10 00:08:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635164472] [2025-01-10 00:08:51,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:51,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:08:51,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:08:51,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:08:51,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635164472] [2025-01-10 00:08:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635164472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680911578] [2025-01-10 00:08:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:51,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:08:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:51,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:08:51,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:08:51,992 INFO L87 Difference]: Start difference. First operand 1062 states and 1216 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-01-10 00:08:56,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:09:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:00,863 INFO L93 Difference]: Finished difference Result 2513 states and 2894 transitions. [2025-01-10 00:09:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:09:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 36 [2025-01-10 00:09:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:00,873 INFO L225 Difference]: With dead ends: 2513 [2025-01-10 00:09:00,877 INFO L226 Difference]: Without dead ends: 2513 [2025-01-10 00:09:00,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:09:00,878 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 3481 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:00,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 1846 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1821 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2025-01-10 00:09:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-01-10 00:09:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1816. [2025-01-10 00:09:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1295 states have (on average 2.0084942084942083) internal successors, (2601), 1727 states have internal predecessors, (2601), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2025-01-10 00:09:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2760 transitions. [2025-01-10 00:09:00,919 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2760 transitions. Word has length 36 [2025-01-10 00:09:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2760 transitions. [2025-01-10 00:09:00,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-01-10 00:09:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2760 transitions. [2025-01-10 00:09:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:00,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:00,921 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:00,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:09:00,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:09:00,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -687279154, now seen corresponding path program 1 times [2025-01-10 00:09:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:00,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950808175] [2025-01-10 00:09:00,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:01,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:01,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:01,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950808175] [2025-01-10 00:09:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950808175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:01,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:09:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030800608] [2025-01-10 00:09:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:01,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:09:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:01,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:09:01,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:09:01,837 INFO L87 Difference]: Start difference. First operand 1816 states and 2760 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:05,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:09:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:09:07,441 INFO L93 Difference]: Finished difference Result 1976 states and 2756 transitions. [2025-01-10 00:09:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:09:07,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:09:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:09:07,448 INFO L225 Difference]: With dead ends: 1976 [2025-01-10 00:09:07,448 INFO L226 Difference]: Without dead ends: 1976 [2025-01-10 00:09:07,448 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-01-10 00:09:07,449 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 421 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:09:07,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1631 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 652 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-01-10 00:09:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-01-10 00:09:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1811. [2025-01-10 00:09:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1295 states have (on average 2.0046332046332047) internal successors, (2596), 1722 states have internal predecessors, (2596), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2025-01-10 00:09:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2755 transitions. [2025-01-10 00:09:07,518 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2755 transitions. Word has length 44 [2025-01-10 00:09:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:09:07,519 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2755 transitions. [2025-01-10 00:09:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:09:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2755 transitions. [2025-01-10 00:09:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:09:07,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:09:07,520 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:09:07,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:09:07,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 491 more)] === [2025-01-10 00:09:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:09:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash -687279153, now seen corresponding path program 1 times [2025-01-10 00:09:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:09:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695243249] [2025-01-10 00:09:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:09:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:09:07,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:09:08,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:09:08,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:09:08,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:09:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695243249] [2025-01-10 00:09:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695243249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:09:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:09:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:09:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191208211] [2025-01-10 00:09:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:09:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:09:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:09:08,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:09:08,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:09:08,849 INFO L87 Difference]: Start difference. First operand 1811 states and 2755 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)