./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/echo-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:29:50,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:29:50,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:29:50,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:29:50,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:29:50,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:29:50,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:29:50,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:29:50,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:29:50,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:29:50,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:29:50,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:29:50,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:29:50,986 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:29:50,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:29:50,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:50,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:29:50,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9ee359f30954fa4d93e8fd6e950c33543e0d3abd082876e3a14e2b9867db5cd [2025-03-17 13:29:51,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:29:51,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:29:51,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:29:51,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:29:51,211 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:29:51,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-03-17 13:29:52,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971655087/3a2e8386b975463686462107f7a94549/FLAGfdda12d7d [2025-03-17 13:29:52,780 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:29:52,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/echo-1.i [2025-03-17 13:29:52,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971655087/3a2e8386b975463686462107f7a94549/FLAGfdda12d7d [2025-03-17 13:29:52,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971655087/3a2e8386b975463686462107f7a94549 [2025-03-17 13:29:52,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:29:52,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:29:52,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:52,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:29:52,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:29:52,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed30677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:52, skipping insertion in model container [2025-03-17 13:29:52,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:52" (1/1) ... [2025-03-17 13:29:52,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:29:53,496 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,515 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,517 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,518 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,519 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,519 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,520 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,520 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,520 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,522 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,527 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,532 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,538 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,543 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,546 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,551 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,559 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:53,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:53,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:29:53,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:53,796 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 13:29:53,805 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:29:53,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53 WrapperNode [2025-03-17 13:29:53,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:53,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:53,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:29:53,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:29:53,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,894 INFO L138 Inliner]: procedures = 599, calls = 554, calls flagged for inlining = 17, calls inlined = 15, statements flattened = 1053 [2025-03-17 13:29:53,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:53,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:29:53,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:29:53,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:29:53,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,937 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 13:29:53,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:53,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:54,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:29:54,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:29:54,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:29:54,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:29:54,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (1/1) ... [2025-03-17 13:29:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:54,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:29:54,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:29:54,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 13:29:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:29:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 13:29:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:29:54,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 13:29:54,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 13:29:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 13:29:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-03-17 13:29:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-03-17 13:29:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 13:29:54,341 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:29:54,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:29:59,383 INFO L? ?]: Removed 460 outVars from TransFormulas that were not future-live. [2025-03-17 13:29:59,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:29:59,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:29:59,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:29:59,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:59 BoogieIcfgContainer [2025-03-17 13:29:59,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:29:59,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:29:59,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:29:59,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:29:59,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:52" (1/3) ... [2025-03-17 13:29:59,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7139ed98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:59, skipping insertion in model container [2025-03-17 13:29:59,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:53" (2/3) ... [2025-03-17 13:29:59,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7139ed98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:59, skipping insertion in model container [2025-03-17 13:29:59,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:59" (3/3) ... [2025-03-17 13:29:59,421 INFO L128 eAbstractionObserver]: Analyzing ICFG echo-1.i [2025-03-17 13:29:59,433 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:29:59,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG echo-1.i that has 5 procedures, 429 locations, 1 initial locations, 19 loop locations, and 175 error locations. [2025-03-17 13:29:59,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:29:59,484 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;@112fa9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:29:59,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 175 error locations. [2025-03-17 13:29:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 240 states have (on average 2.033333333333333) internal successors, (488), 415 states have internal predecessors, (488), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 13:29:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:59,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:59,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:59,494 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-03-17 13:29:59,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 17983, now seen corresponding path program 1 times [2025-03-17 13:29:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819284842] [2025-03-17 13:29:59,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:59,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:30:00,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:30:00,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:00,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819284842] [2025-03-17 13:30:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819284842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:00,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:30:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032696074] [2025-03-17 13:30:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:00,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:00,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:00,383 INFO L87 Difference]: Start difference. First operand has 429 states, 240 states have (on average 2.033333333333333) internal successors, (488), 415 states have internal predecessors, (488), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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-03-17 13:30:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,684 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2025-03-17 13:30:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:00,686 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-03-17 13:30:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,693 INFO L225 Difference]: With dead ends: 399 [2025-03-17 13:30:00,693 INFO L226 Difference]: Without dead ends: 397 [2025-03-17 13:30:00,694 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-03-17 13:30:00,698 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 221 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 387 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:30:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-17 13:30:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 285. [2025-03-17 13:30:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 168 states have (on average 1.8869047619047619) internal successors, (317), 276 states have internal predecessors, (317), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 327 transitions. [2025-03-17 13:30:00,749 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 327 transitions. Word has length 2 [2025-03-17 13:30:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,750 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 327 transitions. [2025-03-17 13:30:00,750 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-03-17 13:30:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 327 transitions. [2025-03-17 13:30:00,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:30:00,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:30:00,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:30:00,751 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-03-17 13:30:00,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 17984, now seen corresponding path program 1 times [2025-03-17 13:30:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547192747] [2025-03-17 13:30:00,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:00,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:30:00,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:30:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:01,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547192747] [2025-03-17 13:30:01,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547192747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:30:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424056946] [2025-03-17 13:30:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:01,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:01,273 INFO L87 Difference]: Start difference. First operand 285 states and 327 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-03-17 13:30:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:01,417 INFO L93 Difference]: Finished difference Result 284 states and 326 transitions. [2025-03-17 13:30:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:01,417 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-03-17 13:30:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:01,419 INFO L225 Difference]: With dead ends: 284 [2025-03-17 13:30:01,419 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 13:30:01,419 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-03-17 13:30:01,419 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 10 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:01,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 531 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 13:30:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-17 13:30:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 168 states have (on average 1.880952380952381) internal successors, (316), 275 states have internal predecessors, (316), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 326 transitions. [2025-03-17 13:30:01,427 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 326 transitions. Word has length 2 [2025-03-17 13:30:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:01,427 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 326 transitions. [2025-03-17 13:30:01,427 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-03-17 13:30:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 326 transitions. [2025-03-17 13:30:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:30:01,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:01,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:30:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:30:01,428 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-03-17 13:30:01,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 536225872, now seen corresponding path program 1 times [2025-03-17 13:30:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361186641] [2025-03-17 13:30:01,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:30:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:30:01,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361186641] [2025-03-17 13:30:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361186641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992265923] [2025-03-17 13:30:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:01,783 INFO L87 Difference]: Start difference. First operand 284 states and 326 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-03-17 13:30:05,802 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-03-17 13:30:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:05,858 INFO L93 Difference]: Finished difference Result 287 states and 330 transitions. [2025-03-17 13:30:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:05,859 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-03-17 13:30:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:05,860 INFO L225 Difference]: With dead ends: 287 [2025-03-17 13:30:05,860 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 13:30:05,860 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-03-17 13:30:05,860 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 639 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:05,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 639 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 13:30:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 13:30:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2025-03-17 13:30:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 169 states have (on average 1.8757396449704142) internal successors, (317), 276 states have internal predecessors, (317), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 327 transitions. [2025-03-17 13:30:05,867 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 327 transitions. Word has length 5 [2025-03-17 13:30:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 327 transitions. [2025-03-17 13:30:05,867 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-03-17 13:30:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 327 transitions. [2025-03-17 13:30:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:30:05,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:05,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:30:05,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:30:05,868 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-03-17 13:30:05,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash 536226033, now seen corresponding path program 1 times [2025-03-17 13:30:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:05,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034236131] [2025-03-17 13:30:05,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:30:06,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:30:06,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:06,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034236131] [2025-03-17 13:30:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034236131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189831134] [2025-03-17 13:30:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:06,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:06,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:06,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:06,409 INFO L87 Difference]: Start difference. First operand 285 states and 327 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-03-17 13:30:10,431 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-03-17 13:30:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:10,718 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2025-03-17 13:30:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:10,718 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-03-17 13:30:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:10,719 INFO L225 Difference]: With dead ends: 287 [2025-03-17 13:30:10,719 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 13:30:10,719 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-03-17 13:30:10,721 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 11 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:10,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 531 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 13:30:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 13:30:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2025-03-17 13:30:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 170 states have (on average 1.8705882352941177) internal successors, (318), 277 states have internal predecessors, (318), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 328 transitions. [2025-03-17 13:30:10,740 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 328 transitions. Word has length 5 [2025-03-17 13:30:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 328 transitions. [2025-03-17 13:30:10,740 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-03-17 13:30:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 328 transitions. [2025-03-17 13:30:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:30:10,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:10,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:10,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:30:10,741 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-03-17 13:30:10,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1726835002, now seen corresponding path program 1 times [2025-03-17 13:30:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671618607] [2025-03-17 13:30:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:10,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:30:10,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:30:10,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:10,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671618607] [2025-03-17 13:30:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671618607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853676216] [2025-03-17 13:30:11,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:11,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:11,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:11,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:30:11,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:30:11,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:30:11,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:30:11,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:30:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:11,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853676216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:11,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:30:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291356106] [2025-03-17 13:30:11,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:11,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:11,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:11,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:11,678 INFO L87 Difference]: Start difference. First operand 286 states and 328 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-03-17 13:30:15,699 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-03-17 13:30:19,707 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-03-17 13:30:23,722 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-03-17 13:30:27,755 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-03-17 13:30:31,772 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-03-17 13:30:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:31,845 INFO L93 Difference]: Finished difference Result 294 states and 338 transitions. [2025-03-17 13:30:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:31,846 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-03-17 13:30:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:31,847 INFO L225 Difference]: With dead ends: 294 [2025-03-17 13:30:31,847 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 13:30:31,847 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-03-17 13:30:31,848 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 4 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:31,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1275 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-17 13:30:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 13:30:31,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-17 13:30:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 178 states have (on average 1.8426966292134832) internal successors, (328), 285 states have internal predecessors, (328), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:30:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 338 transitions. [2025-03-17 13:30:31,861 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 338 transitions. Word has length 8 [2025-03-17 13:30:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 338 transitions. [2025-03-17 13:30:31,862 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-03-17 13:30:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 338 transitions. [2025-03-17 13:30:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:30:31,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:31,862 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:31,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:30:32,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:32,063 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-03-17 13:30:32,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1726835163, now seen corresponding path program 1 times [2025-03-17 13:30:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008729109] [2025-03-17 13:30:32,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:32,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:30:32,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:30:32,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:32,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008729109] [2025-03-17 13:30:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008729109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423863397] [2025-03-17 13:30:32,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:32,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:32,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:30:32,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:30:33,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:30:33,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:30:33,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:33,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:33,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:30:33,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:33,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:33,476 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-03-17 13:30:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423863397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:33,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:30:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52753457] [2025-03-17 13:30:33,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:30:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:33,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:30:33,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:30:33,493 INFO L87 Difference]: Start difference. First operand 294 states and 338 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-03-17 13:30:37,511 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-03-17 13:30:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:30:45,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:30:49,601 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-03-17 13:30:53,612 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-03-17 13:30:57,617 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-03-17 13:31:01,637 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-03-17 13:31:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:02,565 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2025-03-17 13:31:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:31:02,568 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-03-17 13:31:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:02,569 INFO L225 Difference]: With dead ends: 293 [2025-03-17 13:31:02,569 INFO L226 Difference]: Without dead ends: 293 [2025-03-17 13:31:02,569 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-03-17 13:31:02,570 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 559 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:02,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1493 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 634 Invalid, 7 Unknown, 0 Unchecked, 29.0s Time] [2025-03-17 13:31:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-17 13:31:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-17 13:31:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 178 states have (on average 1.8258426966292134) internal successors, (325), 284 states have internal predecessors, (325), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 13:31:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 335 transitions. [2025-03-17 13:31:02,579 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 335 transitions. Word has length 8 [2025-03-17 13:31:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:02,579 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 335 transitions. [2025-03-17 13:31:02,579 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-03-17 13:31:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 335 transitions. [2025-03-17 13:31:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:31:02,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:02,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:31:02,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:02,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 13:31:02,780 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-03-17 13:31:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash -412870704, now seen corresponding path program 2 times [2025-03-17 13:31:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321581692] [2025-03-17 13:31:02,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:02,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 13:31:02,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-17 13:31:02,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:31:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 13:31:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321581692] [2025-03-17 13:31:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321581692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:03,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:03,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:03,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042877410] [2025-03-17 13:31:03,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:03,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:31:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:03,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:31:03,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:03,321 INFO L87 Difference]: Start difference. First operand 293 states and 335 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-03-17 13:31:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:03,731 INFO L93 Difference]: Finished difference Result 430 states and 498 transitions. [2025-03-17 13:31:03,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:31:03,733 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-03-17 13:31:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:03,735 INFO L225 Difference]: With dead ends: 430 [2025-03-17 13:31:03,735 INFO L226 Difference]: Without dead ends: 430 [2025-03-17 13:31:03,735 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-03-17 13:31:03,737 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 460 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:03,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 420 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 13:31:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-17 13:31:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 339. [2025-03-17 13:31:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 221 states have (on average 1.8190045248868778) internal successors, (402), 327 states have internal predecessors, (402), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 13:31:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 416 transitions. [2025-03-17 13:31:03,750 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 416 transitions. Word has length 17 [2025-03-17 13:31:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:03,750 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 416 transitions. [2025-03-17 13:31:03,750 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-03-17 13:31:03,750 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 416 transitions. [2025-03-17 13:31:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:31:03,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:03,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:31:03,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:31:03,751 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-03-17 13:31:03,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash -412870703, now seen corresponding path program 1 times [2025-03-17 13:31:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:03,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683718078] [2025-03-17 13:31:03,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:03,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:31:03,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:31:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:04,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683718078] [2025-03-17 13:31:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683718078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921393718] [2025-03-17 13:31:04,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:04,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:04,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:04,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:04,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:31:04,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:31:04,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:31:04,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:04,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:04,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:31:04,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:04,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921393718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:04,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:31:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941234143] [2025-03-17 13:31:04,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:04,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:31:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:04,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:31:04,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:31:04,931 INFO L87 Difference]: Start difference. First operand 339 states and 416 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-03-17 13:31:08,950 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-03-17 13:31:12,977 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-03-17 13:31:16,983 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-03-17 13:31:20,987 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-03-17 13:31:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:31:29,033 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-03-17 13:31:32,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []