./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/echo-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/echo-1.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 c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:40:51,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:40:51,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:40:51,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:40:51,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:40:51,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:40:51,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:40:51,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:40:51,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:40:51,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:40:51,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:40:51,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:40:51,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:40:51,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:40:51,930 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:40:51,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:40:51,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:40:51,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:40:51,930 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:40:51,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:51,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:40:51,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:40:51,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:40:51,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:40:51,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:40:51,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:40:51,932 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 -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2025-02-08 07:40:52,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:40:52,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:40:52,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:40:52,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:40:52,197 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:40:52,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-02-08 07:40:54,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db2cea201/b712b2f6d65c40748a36b9fd54ccd204/FLAGce5b4742b [2025-02-08 07:40:54,470 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:40:54,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-02-08 07:40:54,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db2cea201/b712b2f6d65c40748a36b9fd54ccd204/FLAGce5b4742b [2025-02-08 07:40:54,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db2cea201/b712b2f6d65c40748a36b9fd54ccd204 [2025-02-08 07:40:54,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:40:54,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:40:54,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:54,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:40:54,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:40:54,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:54" (1/1) ... [2025-02-08 07:40:54,637 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e5cd1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:54, skipping insertion in model container [2025-02-08 07:40:54,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:54" (1/1) ... [2025-02-08 07:40:54,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:40:55,260 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,263 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,272 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,274 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,274 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,274 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,275 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,275 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,276 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,277 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,278 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,281 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,287 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,288 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,289 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,291 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,292 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,292 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,294 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,294 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,311 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:40:55,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:55,351 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:40:55,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:55,542 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:40:55,549 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:40:55,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55 WrapperNode [2025-02-08 07:40:55,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:55,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:55,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:40:55,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:40:55,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,691 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1053 [2025-02-08 07:40:55,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:55,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:40:55,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:40:55,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:40:55,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,740 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:40:55,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:40:55,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:40:55,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:40:55,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:40:55,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (1/1) ... [2025-02-08 07:40:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:55,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:55,904 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-02-08 07:40:55,907 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-02-08 07:40:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:40:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:40:55,926 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 07:40:55,927 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 07:40:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:40:55,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:40:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:40:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:40:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:40:55,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:40:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:40:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:40:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:40:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:40:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:40:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:40:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:40:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:40:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:40:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 07:40:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:40:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-02-08 07:40:55,930 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-02-08 07:40:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:40:56,212 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:40:56,214 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !(0 == ~total~0#1);#res#1 := ~total~0#1; [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: assume !!(0 == ~total~0#1);#res#1 := ~cc~0#1; [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume ~cc~0#1 < 0; [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: assume !(~cc~0#1 < 0);~total~0#1 := ~total~0#1 + ~cc~0#1;~buf#1.base, ~buf#1.offset := ~buf#1.base, ~buf#1.offset + ~cc~0#1;~len#1 := ~len#1 - ~cc~0#1; [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2547: #t~ret135#1 := safe_write_#res#1;havoc safe_write_#t~ret136#1, safe_write_#t~mem137#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~2#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= #t~ret135#1 && #t~ret135#1 <= 9223372036854775807;~cc~0#1 := #t~ret135#1;havoc #t~ret135#1; [2025-02-08 07:40:56,286 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: SUMMARY for call safe_write_#t~mem137#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: assume safe_write_~n~2#1 < 0; [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: assume !(safe_write_~n~2#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem137#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: safe_write_#t~ret136#1 := write_#res#1;havoc write_#t~nondet176#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret136#1 && safe_write_#t~ret136#1 <= 9223372036854775807;safe_write_~n~2#1 := safe_write_#t~ret136#1;havoc safe_write_#t~ret136#1; [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:40:56,287 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2398: #t~ret107#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet134#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret107#1 && #t~ret107#1 <= 2147483647;havoc #t~ret107#1; [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: SUMMARY for call #t~ret109#1 := full_write(2, #t~mem108#1.base, #t~mem108#1.offset, ~used~0#1); srcloc: null [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399: assume -9223372036854775808 <= #t~ret109#1 && #t~ret109#1 <= 9223372036854775807;havoc #t~mem108#1.base, #t~mem108#1.offset;havoc #t~ret109#1; [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: SUMMARY for call #t~mem108#1.base, #t~mem108#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: assume !(1 == #valid[~#msg~0#1.base]); [2025-02-08 07:40:56,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-2: assume !(8 + ~#msg~0#1.offset <= #length[~#msg~0#1.base] && 0 <= ~#msg~0#1.offset); [2025-02-08 07:41:01,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: __main_#t~ret123#1.base, __main_#t~ret123#1.offset := stpcpy_#res#1.base, stpcpy_#res#1.offset;havoc stpcpy_#t~post142#1.base, stpcpy_#t~post142#1.offset, stpcpy_#t~post143#1.base, stpcpy_#t~post143#1.offset, stpcpy_#t~mem144#1, stpcpy_~dest#1.base, stpcpy_~dest#1.offset, stpcpy_~src#1.base, stpcpy_~src#1.offset;havoc stpcpy_#in~dest#1.base, stpcpy_#in~dest#1.offset, stpcpy_#in~src#1.base, stpcpy_#in~src#1.offset;assume { :end_inline_stpcpy } true;__main_~out~0#1.base, __main_~out~0#1.offset := __main_#t~ret123#1.base, __main_#t~ret123#1.offset; [2025-02-08 07:41:01,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: __main_#t~ret128#1 := bb_process_escape_sequence_#res#1;havoc bb_process_escape_sequence_#t~mem78#1.base, bb_process_escape_sequence_#t~mem78#1.offset, bb_process_escape_sequence_#t~mem79#1, bb_process_escape_sequence_#t~mem80#1, bb_process_escape_sequence_#t~bitwise81#1, bb_process_escape_sequence_~r~0#1, bb_process_escape_sequence_~d~0#1, bb_process_escape_sequence_#t~mem82#1, bb_process_escape_sequence_#t~mem83#1, bb_process_escape_sequence_#t~mem84#1, bb_process_escape_sequence_#t~mem85#1, bb_process_escape_sequence_~p~2#1.base, bb_process_escape_sequence_~p~2#1.offset, bb_process_escape_sequence_~ptr#1.base, bb_process_escape_sequence_~ptr#1.offset, bb_process_escape_sequence_~q~0#1.base, bb_process_escape_sequence_~q~0#1.offset, bb_process_escape_sequence_~num_digits~0#1, bb_process_escape_sequence_~n~0#1, bb_process_escape_sequence_~base~0#1;havoc bb_process_escape_sequence_#in~ptr#1.base, bb_process_escape_sequence_#in~ptr#1.offset;assume { :end_inline_bb_process_escape_sequence } true;assume -128 <= __main_#t~ret128#1 && __main_#t~ret128#1 <= 127;__main_~return_value_bb_process_escape_sequence$4~0#1 := __main_#t~ret128#1;havoc __main_#t~ret128#1;__main_~c~0#1 := __main_~return_value_bb_process_escape_sequence$4~0#1; [2025-02-08 07:41:01,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2502: __main_~arg~0#1.base, __main_~arg~0#1.offset := __main_#t~mem129#1.base, __main_#t~mem129#1.offset;call ULTIMATE.dealloc(__main_~#z~0#1.base, __main_~#z~0#1.offset);havoc __main_~#z~0#1.base, __main_~#z~0#1.offset;havoc __main_~#z~0#1.base, __main_~#z~0#1.offset, __main_~return_value_bb_process_escape_sequence$4~0#1;havoc __main_#t~mem129#1.base, __main_#t~mem129#1.offset; [2025-02-08 07:41:01,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2502-1: SUMMARY for call __main_#t~mem129#1.base, __main_#t~mem129#1.offset := read~$Pointer$(__main_~#z~0#1.base, __main_~#z~0#1.offset, 8); srcloc: null [2025-02-08 07:41:01,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2502-1: assume !(1 == #valid[__main_~#z~0#1.base]); [2025-02-08 07:41:01,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2502-1: assume !(8 + __main_~#z~0#1.offset <= #length[__main_~#z~0#1.base] && 0 <= __main_~#z~0#1.offset); [2025-02-08 07:41:01,141 INFO L? ?]: Removed 464 outVars from TransFormulas that were not future-live. [2025-02-08 07:41:01,141 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:41:01,159 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:41:01,159 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:41:01,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:41:01 BoogieIcfgContainer [2025-02-08 07:41:01,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:41:01,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:41:01,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:41:01,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:41:01,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:40:54" (1/3) ... [2025-02-08 07:41:01,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c32235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:41:01, skipping insertion in model container [2025-02-08 07:41:01,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:55" (2/3) ... [2025-02-08 07:41:01,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c32235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:41:01, skipping insertion in model container [2025-02-08 07:41:01,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:41:01" (3/3) ... [2025-02-08 07:41:01,167 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2025-02-08 07:41:01,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:41:01,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 425 locations, 1 initial locations, 19 loop locations, and 175 error locations. [2025-02-08 07:41:01,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:41:01,216 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;@46185b74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:41:01,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 175 error locations. [2025-02-08 07:41:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 234 states have (on average 2.017094017094017) internal successors, (472), 412 states have internal predecessors, (472), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 07:41:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:41:01,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:01,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:41:01,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash 18367, now seen corresponding path program 1 times [2025-02-08 07:41:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:01,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913553587] [2025-02-08 07:41:01,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:01,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:41:01,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:41:01,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:01,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913553587] [2025-02-08 07:41:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913553587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:41:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764948025] [2025-02-08 07:41:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:02,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:02,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:02,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:02,034 INFO L87 Difference]: Start difference. First operand has 425 states, 234 states have (on average 2.017094017094017) internal successors, (472), 412 states have internal predecessors, (472), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 07:41:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:02,259 INFO L93 Difference]: Finished difference Result 283 states and 315 transitions. [2025-02-08 07:41:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:41:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:02,266 INFO L225 Difference]: With dead ends: 283 [2025-02-08 07:41:02,266 INFO L226 Difference]: Without dead ends: 270 [2025-02-08 07:41:02,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 07:41:02,269 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 221 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:02,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 280 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-08 07:41:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-08 07:41:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 158 states have (on average 1.8481012658227849) internal successors, (292), 262 states have internal predecessors, (292), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2025-02-08 07:41:02,302 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 2 [2025-02-08 07:41:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2025-02-08 07:41:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 07:41:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2025-02-08 07:41:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:41:02,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:02,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:41:02,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:41:02,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash 18368, now seen corresponding path program 1 times [2025-02-08 07:41:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:02,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459366312] [2025-02-08 07:41:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:02,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:41:02,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:41:02,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:02,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:02,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459366312] [2025-02-08 07:41:02,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459366312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:02,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:02,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:41:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922745369] [2025-02-08 07:41:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:02,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:02,914 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 07:41:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:03,055 INFO L93 Difference]: Finished difference Result 269 states and 299 transitions. [2025-02-08 07:41:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:03,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-02-08 07:41:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:03,057 INFO L225 Difference]: With dead ends: 269 [2025-02-08 07:41:03,057 INFO L226 Difference]: Without dead ends: 269 [2025-02-08 07:41:03,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 07:41:03,058 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 10 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:03,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 482 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-08 07:41:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-08 07:41:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 158 states have (on average 1.8417721518987342) internal successors, (291), 261 states have internal predecessors, (291), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 299 transitions. [2025-02-08 07:41:03,066 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 299 transitions. Word has length 2 [2025-02-08 07:41:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:03,066 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 299 transitions. [2025-02-08 07:41:03,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-02-08 07:41:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 299 transitions. [2025-02-08 07:41:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:41:03,066 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:03,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:41:03,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:41:03,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:03,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash 547677532, now seen corresponding path program 1 times [2025-02-08 07:41:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839549738] [2025-02-08 07:41:03,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:03,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:03,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:41:03,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:41:03,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:03,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839549738] [2025-02-08 07:41:03,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839549738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920748404] [2025-02-08 07:41:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:03,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:03,368 INFO L87 Difference]: Start difference. First operand 269 states and 299 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:07,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:07,417 INFO L93 Difference]: Finished difference Result 272 states and 303 transitions. [2025-02-08 07:41:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:41:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:07,418 INFO L225 Difference]: With dead ends: 272 [2025-02-08 07:41:07,418 INFO L226 Difference]: Without dead ends: 272 [2025-02-08 07:41:07,418 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-02-08 07:41:07,419 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 2 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:07,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 585 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 07:41:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-08 07:41:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2025-02-08 07:41:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 159 states have (on average 1.8364779874213837) internal successors, (292), 262 states have internal predecessors, (292), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2025-02-08 07:41:07,437 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 5 [2025-02-08 07:41:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:07,437 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2025-02-08 07:41:07,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2025-02-08 07:41:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:41:07,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:07,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:41:07,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:41:07,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:07,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 547677693, now seen corresponding path program 1 times [2025-02-08 07:41:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192077124] [2025-02-08 07:41:07,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:07,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:41:07,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:41:07,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:07,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192077124] [2025-02-08 07:41:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192077124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:08,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132928919] [2025-02-08 07:41:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:08,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:08,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:08,030 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:12,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:12,267 INFO L93 Difference]: Finished difference Result 272 states and 302 transitions. [2025-02-08 07:41:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:41:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:12,269 INFO L225 Difference]: With dead ends: 272 [2025-02-08 07:41:12,269 INFO L226 Difference]: Without dead ends: 272 [2025-02-08 07:41:12,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:41:12,270 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 11 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:12,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 482 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 07:41:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-08 07:41:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2025-02-08 07:41:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.83125) internal successors, (293), 263 states have internal predecessors, (293), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2025-02-08 07:41:12,284 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 5 [2025-02-08 07:41:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:12,284 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2025-02-08 07:41:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2025-02-08 07:41:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:41:12,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:12,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:41:12,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:12,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash -714133702, now seen corresponding path program 1 times [2025-02-08 07:41:12,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:12,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637703133] [2025-02-08 07:41:12,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:41:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:41:12,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637703133] [2025-02-08 07:41:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637703133] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560656164] [2025-02-08 07:41:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:12,673 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-02-08 07:41:12,677 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-02-08 07:41:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:41:13,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:41:13,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:13,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:13,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:41:13,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:13,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:13,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560656164] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:13,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:13,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:41:13,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689497967] [2025-02-08 07:41:13,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:13,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:13,186 INFO L87 Difference]: Start difference. First operand 271 states and 301 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-02-08 07:41:17,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:21,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:25,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:29,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:33,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:33,323 INFO L93 Difference]: Finished difference Result 279 states and 311 transitions. [2025-02-08 07:41:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:33,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:41:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:33,324 INFO L225 Difference]: With dead ends: 279 [2025-02-08 07:41:33,324 INFO L226 Difference]: Without dead ends: 279 [2025-02-08 07:41:33,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:33,325 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 4 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:33,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1167 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-02-08 07:41:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-08 07:41:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-02-08 07:41:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8035714285714286) internal successors, (303), 271 states have internal predecessors, (303), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2025-02-08 07:41:33,330 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 8 [2025-02-08 07:41:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2025-02-08 07:41:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-02-08 07:41:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2025-02-08 07:41:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:41:33,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:33,330 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:33,341 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-02-08 07:41:33,531 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-02-08 07:41:33,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:33,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -714133541, now seen corresponding path program 1 times [2025-02-08 07:41:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835732774] [2025-02-08 07:41:33,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:41:33,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:41:33,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:33,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835732774] [2025-02-08 07:41:34,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835732774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:34,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737177126] [2025-02-08 07:41:34,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:34,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:34,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:34,171 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-02-08 07:41:34,186 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-02-08 07:41:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:41:34,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:41:34,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:34,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:34,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:41:34,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:34,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:34,945 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-02-08 07:41:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737177126] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:34,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:41:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085160561] [2025-02-08 07:41:34,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:41:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:41:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:41:34,981 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-02-08 07:41:38,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:42,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:46,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:47,319 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2025-02-08 07:41:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:41:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:41:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:47,322 INFO L225 Difference]: With dead ends: 278 [2025-02-08 07:41:47,324 INFO L226 Difference]: Without dead ends: 278 [2025-02-08 07:41:47,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:41:47,325 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 289 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:47,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1075 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 435 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2025-02-08 07:41:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-08 07:41:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-08 07:41:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 270 states have internal predecessors, (300), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 308 transitions. [2025-02-08 07:41:47,332 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 308 transitions. Word has length 8 [2025-02-08 07:41:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 308 transitions. [2025-02-08 07:41:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-02-08 07:41:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 308 transitions. [2025-02-08 07:41:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:41:47,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:47,334 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:41:47,344 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-02-08 07:41:47,534 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-02-08 07:41:47,535 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:47,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:47,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1765280732, now seen corresponding path program 2 times [2025-02-08 07:41:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:47,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902682794] [2025-02-08 07:41:47,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:47,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-08 07:41:47,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-02-08 07:41:47,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:41:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 07:41:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902682794] [2025-02-08 07:41:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902682794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:41:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889762955] [2025-02-08 07:41:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:47,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:41:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:47,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:41:47,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:41:47,964 INFO L87 Difference]: Start difference. First operand 278 states and 308 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:48,307 INFO L93 Difference]: Finished difference Result 284 states and 315 transitions. [2025-02-08 07:41:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:48,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-08 07:41:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:48,309 INFO L225 Difference]: With dead ends: 284 [2025-02-08 07:41:48,309 INFO L226 Difference]: Without dead ends: 284 [2025-02-08 07:41:48,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:41:48,309 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 429 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:48,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 263 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:41:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-08 07:41:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 277. [2025-02-08 07:41:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 168 states have (on average 1.7797619047619047) internal successors, (299), 269 states have internal predecessors, (299), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:41:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 307 transitions. [2025-02-08 07:41:48,318 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 307 transitions. Word has length 17 [2025-02-08 07:41:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:48,318 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 307 transitions. [2025-02-08 07:41:48,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:41:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 307 transitions. [2025-02-08 07:41:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:41:48,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:48,319 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-02-08 07:41:48,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:41:48,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:41:48,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:48,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1765280733, now seen corresponding path program 1 times [2025-02-08 07:41:48,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640486802] [2025-02-08 07:41:48,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:41:48,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:41:48,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640486802] [2025-02-08 07:41:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640486802] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937509367] [2025-02-08 07:41:48,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:48,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:48,764 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-02-08 07:41:48,766 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-02-08 07:41:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:41:49,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:41:49,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:49,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:49,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:49,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:49,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:41:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937509367] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:49,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:49,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:41:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125644165] [2025-02-08 07:41:49,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:41:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:49,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:41:49,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:41:49,367 INFO L87 Difference]: Start difference. First operand 277 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-02-08 07:41:53,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:41:57,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:01,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:05,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:09,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:13,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:17,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:21,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:25,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:29,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:33,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 07:42:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:33,623 INFO L93 Difference]: Finished difference Result 295 states and 325 transitions. [2025-02-08 07:42:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:42:33,624 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 17 [2025-02-08 07:42:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:33,627 INFO L225 Difference]: With dead ends: 295 [2025-02-08 07:42:33,627 INFO L226 Difference]: Without dead ends: 295 [2025-02-08 07:42:33,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:42:33,628 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 4 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:33,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1453 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 11 Unknown, 0 Unchecked, 44.2s Time] [2025-02-08 07:42:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-08 07:42:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-08 07:42:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 186 states have (on average 1.7043010752688172) internal successors, (317), 287 states have internal predecessors, (317), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:42:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2025-02-08 07:42:33,640 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 17 [2025-02-08 07:42:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:33,640 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 325 transitions. [2025-02-08 07:42:33,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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-02-08 07:42:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2025-02-08 07:42:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:42:33,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:33,640 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-02-08 07:42:33,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:42:33,841 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-02-08 07:42:33,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:42:33,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash 230423965, now seen corresponding path program 2 times [2025-02-08 07:42:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235584600] [2025-02-08 07:42:33,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:34,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:42:34,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 07:42:34,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:42:34,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235584600] [2025-02-08 07:42:34,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235584600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:34,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115022403] [2025-02-08 07:42:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:34,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:34,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:34,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:34,311 INFO L87 Difference]: Start difference. First operand 295 states and 325 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:34,488 INFO L93 Difference]: Finished difference Result 294 states and 324 transitions. [2025-02-08 07:42:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 07:42:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:34,489 INFO L225 Difference]: With dead ends: 294 [2025-02-08 07:42:34,490 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 07:42:34,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-02-08 07:42:34,490 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:34,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 486 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:42:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 07:42:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-08 07:42:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 186 states have (on average 1.6989247311827957) internal successors, (316), 286 states have internal predecessors, (316), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 07:42:34,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 324 transitions. [2025-02-08 07:42:34,500 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 324 transitions. Word has length 35 [2025-02-08 07:42:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:34,500 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 324 transitions. [2025-02-08 07:42:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 324 transitions. [2025-02-08 07:42:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:42:34,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:34,505 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:42:34,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [full_writeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, full_writeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 172 more)] === [2025-02-08 07:42:34,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2007844185, now seen corresponding path program 1 times [2025-02-08 07:42:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:34,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73095212] [2025-02-08 07:42:34,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:34,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:42:34,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:42:34,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:42:34,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73095212] [2025-02-08 07:42:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73095212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:34,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597074724] [2025-02-08 07:42:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:34,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:34,959 INFO L87 Difference]: Start difference. First operand 294 states and 324 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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)