./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/yes-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/yes-2.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 8c3d0d99b1a4ed01b0f7abd82dc706f1d3a99a21ba3b1eb67aeb8a353cd5545e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:17:16,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:17:16,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 09:17:16,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:17:16,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:17:16,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:17:16,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:17:16,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:17:16,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:17:16,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:17:16,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:17:16,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:17:16,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:17:16,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:17:16,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:17:16,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:17:16,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:17:16,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:17:16,158 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 -> 8c3d0d99b1a4ed01b0f7abd82dc706f1d3a99a21ba3b1eb67aeb8a353cd5545e [2025-03-04 09:17:16,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:17:16,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:17:16,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:17:16,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:17:16,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:17:16,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/yes-2.i [2025-03-04 09:17:17,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bac7933/5b3458dc65c3483daf2b5eb6d599de49/FLAG18da9de11 [2025-03-04 09:17:17,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:17:17,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/yes-2.i [2025-03-04 09:17:18,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bac7933/5b3458dc65c3483daf2b5eb6d599de49/FLAG18da9de11 [2025-03-04 09:17:18,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19bac7933/5b3458dc65c3483daf2b5eb6d599de49 [2025-03-04 09:17:18,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:17:18,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:17:18,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:17:18,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:17:18,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:17:18,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:18,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369d8ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18, skipping insertion in model container [2025-03-04 09:17:18,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:18,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:17:18,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,673 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,675 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,677 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,679 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,680 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,680 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,680 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,687 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,688 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,694 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,694 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,703 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 09:17:18,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:17:18,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:17:18,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:17:18,955 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 09:17:18,961 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:17:18,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18 WrapperNode [2025-03-04 09:17:18,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:17:18,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:17:18,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:17:18,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:17:18,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:18,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,040 INFO L138 Inliner]: procedures = 596, calls = 482, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 770 [2025-03-04 09:17:19,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:17:19,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:17:19,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:17:19,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:17:19,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,071 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 09:17:19,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:17:19,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:17:19,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:17:19,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:17:19,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (1/1) ... [2025-03-04 09:17:19,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:17:19,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:19,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:17:19,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:17:19,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:17:19,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 09:17:19,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 09:17:19,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 09:17:19,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 09:17:19,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:17:19,415 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:17:20,137 INFO L? ?]: Removed 338 outVars from TransFormulas that were not future-live. [2025-03-04 09:17:20,139 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:17:20,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:17:20,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:17:20,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:17:20 BoogieIcfgContainer [2025-03-04 09:17:20,156 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:17:20,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:17:20,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:17:20,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:17:20,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:17:18" (1/3) ... [2025-03-04 09:17:20,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eecfcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:17:20, skipping insertion in model container [2025-03-04 09:17:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:17:18" (2/3) ... [2025-03-04 09:17:20,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eecfcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:17:20, skipping insertion in model container [2025-03-04 09:17:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:17:20" (3/3) ... [2025-03-04 09:17:20,165 INFO L128 eAbstractionObserver]: Analyzing ICFG yes-2.i [2025-03-04 09:17:20,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:17:20,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG yes-2.i that has 3 procedures, 285 locations, 1 initial locations, 13 loop locations, and 116 error locations. [2025-03-04 09:17:20,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:17:20,221 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;@23311bf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:17:20,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 116 error locations. [2025-03-04 09:17:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 161 states have (on average 1.950310559006211) internal successors, (314), 277 states have internal predecessors, (314), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 09:17:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:17:20,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:20,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:17:20,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:20,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 367377, now seen corresponding path program 1 times [2025-03-04 09:17:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314535363] [2025-03-04 09:17:20,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:20,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:17:20,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:17:20,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:20,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:20,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314535363] [2025-03-04 09:17:20,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314535363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398166816] [2025-03-04 09:17:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:20,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:20,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:20,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:20,784 INFO L87 Difference]: Start difference. First operand has 285 states, 161 states have (on average 1.950310559006211) internal successors, (314), 277 states have internal predecessors, (314), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:20,878 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-04 09:17:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:17:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:20,885 INFO L225 Difference]: With dead ends: 62 [2025-03-04 09:17:20,886 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 09:17:20,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:20,890 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:20,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 09:17:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 09:17:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.8) internal successors, (63), 59 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-04 09:17:20,917 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 3 [2025-03-04 09:17:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:20,918 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-04 09:17:20,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-04 09:17:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 09:17:20,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:20,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 09:17:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:17:20,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:20,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 367378, now seen corresponding path program 1 times [2025-03-04 09:17:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852726333] [2025-03-04 09:17:20,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 09:17:20,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 09:17:20,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:20,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852726333] [2025-03-04 09:17:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852726333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150107983] [2025-03-04 09:17:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:21,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:21,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:21,210 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:21,263 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-04 09:17:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 09:17:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:21,265 INFO L225 Difference]: With dead ends: 61 [2025-03-04 09:17:21,265 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 09:17:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:21,265 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:21,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 09:17:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 09:17:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 58 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-04 09:17:21,273 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 3 [2025-03-04 09:17:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:21,273 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-04 09:17:21,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-04 09:17:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:17:21,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:21,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:17:21,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:17:21,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:21,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1940071011, now seen corresponding path program 1 times [2025-03-04 09:17:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:21,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846580327] [2025-03-04 09:17:21,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:17:21,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:17:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846580327] [2025-03-04 09:17:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846580327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053768662] [2025-03-04 09:17:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:21,442 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:21,454 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-04 09:17:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:17:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:21,455 INFO L225 Difference]: With dead ends: 64 [2025-03-04 09:17:21,455 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 09:17:21,456 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-04 09:17:21,456 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:21,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 09:17:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-04 09:17:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.75) internal successors, (63), 59 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2025-03-04 09:17:21,460 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 6 [2025-03-04 09:17:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:21,460 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2025-03-04 09:17:21,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2025-03-04 09:17:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 09:17:21,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:21,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:17:21,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:17:21,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:21,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1940070850, now seen corresponding path program 1 times [2025-03-04 09:17:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392475374] [2025-03-04 09:17:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:21,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:17:21,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:17:21,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:21,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:17:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392475374] [2025-03-04 09:17:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392475374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967425394] [2025-03-04 09:17:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:17:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:21,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:17:21,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:17:21,717 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:21,809 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-04 09:17:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:17:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 09:17:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:21,810 INFO L225 Difference]: With dead ends: 64 [2025-03-04 09:17:21,810 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 09:17:21,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:17:21,810 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:21,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 111 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 09:17:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-04 09:17:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 60 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-03-04 09:17:21,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 6 [2025-03-04 09:17:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-03-04 09:17:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-03-04 09:17:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:17:21,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:21,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:21,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:17:21,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:21,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash 724477996, now seen corresponding path program 1 times [2025-03-04 09:17:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31353869] [2025-03-04 09:17:21,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:21,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:21,962 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-04 09:17:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31353869] [2025-03-04 09:17:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31353869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741389657] [2025-03-04 09:17:21,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:21,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:21,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:21,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:17:22,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:22,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:22,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:22,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:22,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:17:22,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:22,225 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-04 09:17:22,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:22,245 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-04 09:17:22,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741389657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:22,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:17:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315116383] [2025-03-04 09:17:22,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:22,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:22,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:22,247 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:22,274 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-03-04 09:17:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:17:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:22,276 INFO L225 Difference]: With dead ends: 71 [2025-03-04 09:17:22,278 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 09:17:22,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-04 09:17:22,278 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:22,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 09:17:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-04 09:17:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 68 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-03-04 09:17:22,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 9 [2025-03-04 09:17:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-03-04 09:17:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-03-04 09:17:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 09:17:22,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:22,285 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:22,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:17:22,486 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-04 09:17:22,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 724478157, now seen corresponding path program 1 times [2025-03-04 09:17:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631697775] [2025-03-04 09:17:22,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:22,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:22,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:22,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:22,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:22,777 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-04 09:17:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631697775] [2025-03-04 09:17:22,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631697775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501536580] [2025-03-04 09:17:22,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:22,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:22,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:17:22,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 09:17:22,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 09:17:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:22,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 09:17:22,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:23,042 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-04 09:17:23,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:23,106 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-04 09:17:23,115 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-04 09:17:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501536580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:23,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:23,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-04 09:17:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238470018] [2025-03-04 09:17:23,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:23,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 09:17:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:23,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 09:17:23,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:17:23,117 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:23,265 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-04 09:17:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:17:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 09:17:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:23,266 INFO L225 Difference]: With dead ends: 70 [2025-03-04 09:17:23,266 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 09:17:23,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-04 09:17:23,267 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:23,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 175 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 09:17:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-04 09:17:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 67 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-03-04 09:17:23,270 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 9 [2025-03-04 09:17:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:23,270 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-03-04 09:17:23,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-03-04 09:17:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:17:23,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:23,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:23,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:23,471 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-04 09:17:23,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:23,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -992565027, now seen corresponding path program 2 times [2025-03-04 09:17:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267729585] [2025-03-04 09:17:23,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:23,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 09:17:23,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 09:17:23,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:17:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:23,715 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-04 09:17:23,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267729585] [2025-03-04 09:17:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267729585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:23,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:23,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:17:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361636484] [2025-03-04 09:17:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:23,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:23,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:23,717 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:23,753 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2025-03-04 09:17:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:23,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:17:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:23,756 INFO L225 Difference]: With dead ends: 69 [2025-03-04 09:17:23,756 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 09:17:23,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:23,756 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:23,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 09:17:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 09:17:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 66 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-03-04 09:17:23,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 18 [2025-03-04 09:17:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:23,760 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-03-04 09:17:23,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-03-04 09:17:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 09:17:23,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:23,761 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:23,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:17:23,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:23,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash -992565026, now seen corresponding path program 1 times [2025-03-04 09:17:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452128146] [2025-03-04 09:17:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:23,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:17:23,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:17:23,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:23,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:23,961 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-04 09:17:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452128146] [2025-03-04 09:17:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452128146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456214262] [2025-03-04 09:17:23,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:23,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:23,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:23,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:17:24,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:17:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:17:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:24,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:17:24,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:24,202 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-04 09:17:24,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:24,261 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-04 09:17:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456214262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:24,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:17:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503770414] [2025-03-04 09:17:24,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:24,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:17:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:24,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:17:24,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:24,264 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:24,312 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-03-04 09:17:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:17:24,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 09:17:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:24,313 INFO L225 Difference]: With dead ends: 87 [2025-03-04 09:17:24,314 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 09:17:24,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:24,314 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:24,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 09:17:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 09:17:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-03-04 09:17:24,321 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 18 [2025-03-04 09:17:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:24,321 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-04 09:17:24,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-03-04 09:17:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 09:17:24,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:24,322 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:24,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:24,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:24,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:24,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash 560690622, now seen corresponding path program 2 times [2025-03-04 09:17:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377252039] [2025-03-04 09:17:24,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:24,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 09:17:24,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-03-04 09:17:24,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:17:24,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:24,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377252039] [2025-03-04 09:17:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377252039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:24,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:24,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:24,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428610931] [2025-03-04 09:17:24,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:24,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:17:24,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:24,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:17:24,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:17:24,779 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:24,856 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2025-03-04 09:17:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:17:24,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 09:17:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:24,857 INFO L225 Difference]: With dead ends: 86 [2025-03-04 09:17:24,857 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 09:17:24,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:24,858 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:24,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 26 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 09:17:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-04 09:17:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.380952380952381) internal successors, (87), 83 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 09:17:24,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 36 [2025-03-04 09:17:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:24,863 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 09:17:24,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:17:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 09:17:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:17:24,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:24,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:24,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:17:24,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -427202674, now seen corresponding path program 1 times [2025-03-04 09:17:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:24,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246129894] [2025-03-04 09:17:24,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:24,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:24,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:17:24,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:17:24,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:24,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246129894] [2025-03-04 09:17:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246129894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:25,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:25,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452283460] [2025-03-04 09:17:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:25,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:25,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:25,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:25,120 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:25,172 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-04 09:17:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:25,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:17:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:25,173 INFO L225 Difference]: With dead ends: 81 [2025-03-04 09:17:25,173 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 09:17:25,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:25,174 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:25,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 44 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 09:17:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-04 09:17:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 78 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-03-04 09:17:25,179 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 44 [2025-03-04 09:17:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-03-04 09:17:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-03-04 09:17:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 09:17:25,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:25,181 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:17:25,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:25,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash -427202673, now seen corresponding path program 1 times [2025-03-04 09:17:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298981288] [2025-03-04 09:17:25,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:25,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 09:17:25,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 09:17:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298981288] [2025-03-04 09:17:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298981288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083412363] [2025-03-04 09:17:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:25,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:25,810 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:25,866 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-03-04 09:17:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:17:25,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 09:17:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:25,867 INFO L225 Difference]: With dead ends: 92 [2025-03-04 09:17:25,867 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 09:17:25,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:25,867 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:25,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 158 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 09:17:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2025-03-04 09:17:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2025-03-04 09:17:25,873 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 44 [2025-03-04 09:17:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:25,873 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2025-03-04 09:17:25,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2025-03-04 09:17:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:25,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:25,875 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:17:25,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash -806477071, now seen corresponding path program 1 times [2025-03-04 09:17:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037992622] [2025-03-04 09:17:25,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:25,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:25,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:25,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:25,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037992622] [2025-03-04 09:17:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037992622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:26,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:17:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658433166] [2025-03-04 09:17:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:17:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:26,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:17:26,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:17:26,152 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:26,215 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2025-03-04 09:17:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:17:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:17:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:26,215 INFO L225 Difference]: With dead ends: 83 [2025-03-04 09:17:26,215 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 09:17:26,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:26,216 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:26,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 70 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 09:17:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-04 09:17:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 76 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2025-03-04 09:17:26,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 47 [2025-03-04 09:17:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:26,219 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2025-03-04 09:17:26,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2025-03-04 09:17:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:26,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:26,219 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:17:26,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:26,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -806477072, now seen corresponding path program 1 times [2025-03-04 09:17:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:26,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201324562] [2025-03-04 09:17:26,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:26,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:26,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:26,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:26,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201324562] [2025-03-04 09:17:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201324562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655108877] [2025-03-04 09:17:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:17:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:17:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:17:26,403 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:26,471 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-04 09:17:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:17:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:17:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:26,472 INFO L225 Difference]: With dead ends: 77 [2025-03-04 09:17:26,472 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 09:17:26,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:17:26,473 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:26,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 61 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 09:17:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 09:17:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 74 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-04 09:17:26,478 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 47 [2025-03-04 09:17:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:26,478 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-04 09:17:26,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-04 09:17:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 09:17:26,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:26,479 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:26,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 09:17:26,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:26,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash -806476143, now seen corresponding path program 1 times [2025-03-04 09:17:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873844294] [2025-03-04 09:17:26,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:26,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 09:17:26,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 09:17:26,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:26,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:26,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873844294] [2025-03-04 09:17:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873844294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:26,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:26,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:17:26,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186962898] [2025-03-04 09:17:26,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:26,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:26,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:26,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:26,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:26,831 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:26,942 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-03-04 09:17:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 09:17:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:26,944 INFO L225 Difference]: With dead ends: 96 [2025-03-04 09:17:26,944 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 09:17:26,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:26,944 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 86 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:26,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 83 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 09:17:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2025-03-04 09:17:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 88 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2025-03-04 09:17:26,953 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 47 [2025-03-04 09:17:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:26,953 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2025-03-04 09:17:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2025-03-04 09:17:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 09:17:26,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:26,953 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:17:26,954 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 769014798, now seen corresponding path program 1 times [2025-03-04 09:17:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:26,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496637694] [2025-03-04 09:17:26,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:26,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:27,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 09:17:27,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 09:17:27,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:27,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496637694] [2025-03-04 09:17:27,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496637694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:27,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:27,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:27,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946739528] [2025-03-04 09:17:27,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:27,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:27,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:27,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:27,222 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:27,271 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2025-03-04 09:17:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:27,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 09:17:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:27,272 INFO L225 Difference]: With dead ends: 96 [2025-03-04 09:17:27,272 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 09:17:27,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:27,273 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:27,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 144 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 09:17:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2025-03-04 09:17:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 88 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-03-04 09:17:27,275 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 48 [2025-03-04 09:17:27,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:27,276 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-03-04 09:17:27,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-03-04 09:17:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:17:27,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:27,276 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:27,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 09:17:27,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:27,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:27,277 INFO L85 PathProgramCache]: Analyzing trace with hash 316529833, now seen corresponding path program 1 times [2025-03-04 09:17:27,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:27,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721812987] [2025-03-04 09:17:27,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:27,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:27,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:17:27,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:17:27,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:27,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721812987] [2025-03-04 09:17:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721812987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:17:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406572780] [2025-03-04 09:17:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:27,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:27,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:27,509 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:27,543 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2025-03-04 09:17:27,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:27,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 09:17:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:27,544 INFO L225 Difference]: With dead ends: 90 [2025-03-04 09:17:27,544 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 09:17:27,545 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-04 09:17:27,545 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:27,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 09:17:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 09:17:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 87 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-03-04 09:17:27,547 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 50 [2025-03-04 09:17:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-03-04 09:17:27,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-03-04 09:17:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 09:17:27,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:27,548 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 09:17:27,548 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 316529834, now seen corresponding path program 1 times [2025-03-04 09:17:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929921321] [2025-03-04 09:17:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:27,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 09:17:27,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 09:17:27,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:27,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:28,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929921321] [2025-03-04 09:17:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929921321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:28,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:17:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667110221] [2025-03-04 09:17:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:28,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:17:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:28,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:17:28,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:17:28,114 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:28,259 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-03-04 09:17:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:17:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-04 09:17:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:28,260 INFO L225 Difference]: With dead ends: 94 [2025-03-04 09:17:28,260 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 09:17:28,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:28,261 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 98 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 09:17:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-04 09:17:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 87 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-03-04 09:17:28,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 50 [2025-03-04 09:17:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:28,264 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-03-04 09:17:28,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-03-04 09:17:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:17:28,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:28,264 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:28,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:17:28,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2007652151, now seen corresponding path program 1 times [2025-03-04 09:17:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313817915] [2025-03-04 09:17:28,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:28,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:28,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:17:28,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:17:28,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:28,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313817915] [2025-03-04 09:17:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313817915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684496367] [2025-03-04 09:17:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:28,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:28,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:28,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:28,622 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:28,706 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2025-03-04 09:17:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 09:17:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:28,707 INFO L225 Difference]: With dead ends: 89 [2025-03-04 09:17:28,707 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 09:17:28,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:28,708 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:28,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 119 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 09:17:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 09:17:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 86 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2025-03-04 09:17:28,710 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 53 [2025-03-04 09:17:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:28,710 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2025-03-04 09:17:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2025-03-04 09:17:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 09:17:28,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:28,711 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:28,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:17:28,711 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:28,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2007652150, now seen corresponding path program 1 times [2025-03-04 09:17:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040567355] [2025-03-04 09:17:28,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 09:17:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 09:17:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040567355] [2025-03-04 09:17:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040567355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:17:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205223302] [2025-03-04 09:17:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:29,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:29,282 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:29,375 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2025-03-04 09:17:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:29,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 09:17:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:29,376 INFO L225 Difference]: With dead ends: 88 [2025-03-04 09:17:29,376 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 09:17:29,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:17:29,377 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:29,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 116 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 09:17:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 09:17:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 85 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-04 09:17:29,382 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 53 [2025-03-04 09:17:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:29,383 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-04 09:17:29,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-04 09:17:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 09:17:29,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:29,383 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:29,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 09:17:29,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:29,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1596928899, now seen corresponding path program 1 times [2025-03-04 09:17:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245789209] [2025-03-04 09:17:29,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:29,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 09:17:29,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 09:17:29,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:29,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245789209] [2025-03-04 09:17:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245789209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:29,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:17:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317441392] [2025-03-04 09:17:29,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:29,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:17:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:29,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:17:29,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:17:29,506 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:29,516 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2025-03-04 09:17:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:17:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-04 09:17:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:29,518 INFO L225 Difference]: With dead ends: 100 [2025-03-04 09:17:29,518 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 09:17:29,519 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-04 09:17:29,519 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:29,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 09:17:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-03-04 09:17:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 87 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2025-03-04 09:17:29,521 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 57 [2025-03-04 09:17:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:29,522 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-03-04 09:17:29,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2025-03-04 09:17:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:17:29,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:29,522 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:29,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 09:17:29,522 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2035058271, now seen corresponding path program 1 times [2025-03-04 09:17:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948750114] [2025-03-04 09:17:29,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:17:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:17:29,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:29,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948750114] [2025-03-04 09:17:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948750114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:17:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324661572] [2025-03-04 09:17:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:30,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:17:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:30,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:17:30,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:17:30,057 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:30,200 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-04 09:17:30,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:17:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 09:17:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:30,201 INFO L225 Difference]: With dead ends: 97 [2025-03-04 09:17:30,201 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 09:17:30,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:17:30,202 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:30,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 09:17:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 09:17:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 93 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2025-03-04 09:17:30,204 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 58 [2025-03-04 09:17:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:30,204 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2025-03-04 09:17:30,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2025-03-04 09:17:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 09:17:30,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:30,205 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:30,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 09:17:30,205 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:30,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2035058272, now seen corresponding path program 1 times [2025-03-04 09:17:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:30,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834664458] [2025-03-04 09:17:30,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:30,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:17:30,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:17:30,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:30,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834664458] [2025-03-04 09:17:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834664458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:17:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:17:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 09:17:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339149013] [2025-03-04 09:17:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:17:31,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 09:17:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:31,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 09:17:31,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 09:17:31,251 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:31,524 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-03-04 09:17:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:17:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 09:17:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:31,525 INFO L225 Difference]: With dead ends: 98 [2025-03-04 09:17:31,526 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 09:17:31,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-04 09:17:31,527 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 101 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:31,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 163 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:17:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 09:17:31,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-03-04 09:17:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.2) internal successors, (102), 93 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2025-03-04 09:17:31,532 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 58 [2025-03-04 09:17:31,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:31,532 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2025-03-04 09:17:31,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2025-03-04 09:17:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 09:17:31,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:31,533 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:31,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 09:17:31,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:31,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1498339260, now seen corresponding path program 1 times [2025-03-04 09:17:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:31,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344170984] [2025-03-04 09:17:31,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:17:31,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:17:31,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:31,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344170984] [2025-03-04 09:17:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344170984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932820327] [2025-03-04 09:17:31,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:31,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:31,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:31,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:17:31,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 09:17:31,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 09:17:31,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:31,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:31,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 09:17:31,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:32,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:32,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932820327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:32,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:32,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 09:17:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494416182] [2025-03-04 09:17:32,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:32,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:17:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:32,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:17:32,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:17:32,039 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:32,066 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2025-03-04 09:17:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:17:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-04 09:17:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:32,067 INFO L225 Difference]: With dead ends: 125 [2025-03-04 09:17:32,067 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 09:17:32,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 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-04 09:17:32,068 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:32,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 171 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 09:17:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2025-03-04 09:17:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 117 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-03-04 09:17:32,072 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 62 [2025-03-04 09:17:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:32,072 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-03-04 09:17:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-03-04 09:17:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:17:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:32,072 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:32,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:32,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:32,273 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -795876608, now seen corresponding path program 1 times [2025-03-04 09:17:32,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:32,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302974138] [2025-03-04 09:17:32,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:32,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:32,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:32,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:32,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:32,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:32,858 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302974138] [2025-03-04 09:17:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302974138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722382677] [2025-03-04 09:17:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:32,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:32,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:32,861 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:32,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:17:33,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:33,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:33,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:33,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:33,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 09:17:33,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:33,194 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 10 treesize of output 8 [2025-03-04 09:17:33,221 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 09:17:33,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 09:17:33,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:17:33,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 09:17:33,346 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:33,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:17:33,408 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:33,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-04 09:17:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 09:17:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 09:17:33,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:33,523 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2667) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-04 09:17:33,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2667 (Array Int Int)) (v_ArrVal_2666 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2666))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2667)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-04 09:17:37,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:37,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-04 09:17:37,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2862 treesize of output 2230 [2025-03-04 09:17:37,702 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 228 treesize of output 216 [2025-03-04 09:17:37,709 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 125 treesize of output 89 [2025-03-04 09:17:37,714 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 180 treesize of output 120 [2025-03-04 09:17:38,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:38,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2025-03-04 09:17:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-03-04 09:17:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722382677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:38,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-03-04 09:17:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47061201] [2025-03-04 09:17:38,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:17:38,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:38,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:17:38,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=352, Unknown=26, NotChecked=82, Total=552 [2025-03-04 09:17:38,609 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:38,887 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2025-03-04 09:17:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:17:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-04 09:17:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:38,892 INFO L225 Difference]: With dead ends: 119 [2025-03-04 09:17:38,892 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 09:17:38,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=123, Invalid=410, Unknown=27, NotChecked=90, Total=650 [2025-03-04 09:17:38,892 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:38,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 240 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2025-03-04 09:17:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 09:17:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 09:17:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 116 states have internal predecessors, (130), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2025-03-04 09:17:38,897 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 63 [2025-03-04 09:17:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2025-03-04 09:17:38,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2025-03-04 09:17:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 09:17:38,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:38,898 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:38,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:17:39,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 09:17:39,099 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -795876607, now seen corresponding path program 1 times [2025-03-04 09:17:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783556236] [2025-03-04 09:17:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:39,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:39,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:40,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783556236] [2025-03-04 09:17:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783556236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554486382] [2025-03-04 09:17:40,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:40,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:40,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:40,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:40,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:17:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 09:17:40,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 09:17:40,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:40,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:40,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 09:17:40,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:40,426 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 10 treesize of output 8 [2025-03-04 09:17:40,448 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:17:40,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:17:40,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 09:17:40,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:17:40,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 09:17:40,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-04 09:17:40,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 09:17:40,596 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:40,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-04 09:17:40,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-04 09:17:40,700 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 09:17:40,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-04 09:17:40,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2025-03-04 09:17:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-04 09:17:40,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-03-04 09:17:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:40,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:41,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2949))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_2951 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2950) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (< .cse0 0))))) (forall ((v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2949))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 0) (forall ((v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2950))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2952) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-03-04 09:17:41,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2948))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2947) .cse3 v_ArrVal_2949))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_2951 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2950) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (< .cse0 0))))))) (forall ((v_ArrVal_2950 (Array Int Int)) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2947 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2948))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2947) .cse9 v_ArrVal_2949))) (or (forall ((v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2951 (Array Int Int))) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_2950))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_2951) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_2952) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) (< (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 0)))))))) is different from false [2025-03-04 09:17:41,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:41,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 424 [2025-03-04 09:17:41,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:41,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 411 treesize of output 268 [2025-03-04 09:17:41,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19478 treesize of output 15982 [2025-03-04 09:17:41,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48351 treesize of output 46487 [2025-03-04 09:17:41,618 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 3925 treesize of output 3637 [2025-03-04 09:17:41,639 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 3637 treesize of output 3433 [2025-03-04 09:17:41,657 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 3433 treesize of output 2761 [2025-03-04 09:17:41,677 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 2761 treesize of output 2569 [2025-03-04 09:17:41,698 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 2569 treesize of output 2185 [2025-03-04 09:17:41,717 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 2185 treesize of output 2083 [2025-03-04 09:17:41,737 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 2083 treesize of output 2065 [2025-03-04 09:17:41,758 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 2065 treesize of output 2053 [2025-03-04 09:17:41,776 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 2053 treesize of output 2029 [2025-03-04 09:17:41,796 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 2029 treesize of output 2017 [2025-03-04 09:17:41,815 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 2017 treesize of output 2011 [2025-03-04 09:17:53,789 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 09:17:53,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-04 09:17:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554486382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:53,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-03-04 09:17:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254208725] [2025-03-04 09:17:53,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 09:17:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 09:17:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=803, Unknown=6, NotChecked=118, Total=1056 [2025-03-04 09:17:53,796 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:54,718 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2025-03-04 09:17:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:17:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-04 09:17:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:54,719 INFO L225 Difference]: With dead ends: 118 [2025-03-04 09:17:54,719 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 09:17:54,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1348, Unknown=6, NotChecked=158, Total=1806 [2025-03-04 09:17:54,720 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 81 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:54,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 336 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 481 Invalid, 5 Unknown, 95 Unchecked, 0.4s Time] [2025-03-04 09:17:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 09:17:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 09:17:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 109 states have (on average 1.128440366972477) internal successors, (123), 115 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-03-04 09:17:54,725 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 63 [2025-03-04 09:17:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-03-04 09:17:54,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-03-04 09:17:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 09:17:54,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:54,726 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:54,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:17:54,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:54,927 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:54,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash -561679555, now seen corresponding path program 2 times [2025-03-04 09:17:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404521896] [2025-03-04 09:17:54,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:54,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:54,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 09:17:55,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 09:17:55,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:17:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404521896] [2025-03-04 09:17:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404521896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663272365] [2025-03-04 09:17:55,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:17:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:55,204 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:55,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:17:55,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 09:17:55,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 09:17:55,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:17:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:55,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 09:17:55,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:55,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 09:17:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663272365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:55,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 09:17:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021278135] [2025-03-04 09:17:55,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:55,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:17:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:55,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:17:55,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:55,627 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:55,658 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2025-03-04 09:17:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:17:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-03-04 09:17:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:55,659 INFO L225 Difference]: With dead ends: 187 [2025-03-04 09:17:55,659 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 09:17:55,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 09:17:55,659 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:55,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 150 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 09:17:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 09:17:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2025-03-04 09:17:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 169 states have (on average 1.1183431952662721) internal successors, (189), 175 states have internal predecessors, (189), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2025-03-04 09:17:55,663 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 77 [2025-03-04 09:17:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:55,663 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2025-03-04 09:17:55,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2025-03-04 09:17:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 09:17:55,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:55,664 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:55,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 09:17:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:55,864 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:55,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash -5732003, now seen corresponding path program 3 times [2025-03-04 09:17:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572584594] [2025-03-04 09:17:55,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:17:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:55,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-04 09:17:55,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-04 09:17:55,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:17:55,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572584594] [2025-03-04 09:17:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572584594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572597374] [2025-03-04 09:17:56,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:17:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:56,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:56,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:17:56,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 12 equivalence classes. [2025-03-04 09:17:56,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 107 statements. [2025-03-04 09:17:56,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 09:17:56,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:56,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 09:17:56,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:56,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:17:56,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 09:17:56,677 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:17:56,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:17:56,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:17:56,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-04 09:17:57,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:17:57,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:17:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:57,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:57,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:17:57,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-03-04 09:17:57,860 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 66 treesize of output 62 [2025-03-04 09:17:57,882 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 09:17:57,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-03-04 09:17:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572597374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:57,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 09:17:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226886076] [2025-03-04 09:17:57,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 09:17:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:57,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 09:17:57,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-04 09:17:57,912 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:58,083 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2025-03-04 09:17:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:17:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2025-03-04 09:17:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:58,084 INFO L225 Difference]: With dead ends: 175 [2025-03-04 09:17:58,084 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 09:17:58,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:17:58,085 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:58,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 187 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 09:17:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 119. [2025-03-04 09:17:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 116 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2025-03-04 09:17:58,091 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 107 [2025-03-04 09:17:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:58,091 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2025-03-04 09:17:58,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2025-03-04 09:17:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 09:17:58,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:58,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:58,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:17:58,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 09:17:58,293 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:17:58,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:17:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash -177720638, now seen corresponding path program 1 times [2025-03-04 09:17:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:17:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596385204] [2025-03-04 09:17:58,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:17:58,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:17:58,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:17:58,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:58,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:59,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:17:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596385204] [2025-03-04 09:17:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596385204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:17:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763181669] [2025-03-04 09:17:59,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:17:59,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:17:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:17:59,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:17:59,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:17:59,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 09:17:59,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 09:17:59,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:17:59,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:17:59,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 09:17:59,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:17:59,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:17:59,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 09:17:59,431 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:17:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:17:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:59,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:17:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:17:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763181669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:17:59,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:17:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 09:17:59,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620867424] [2025-03-04 09:17:59,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:17:59,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:17:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:17:59,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:17:59,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:17:59,722 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:17:59,872 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2025-03-04 09:17:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:17:59,872 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2025-03-04 09:17:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:17:59,873 INFO L225 Difference]: With dead ends: 177 [2025-03-04 09:17:59,873 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 09:17:59,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-04 09:17:59,874 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 175 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 09:17:59,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 153 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 09:17:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 09:17:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 118. [2025-03-04 09:17:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2025-03-04 09:17:59,876 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 108 [2025-03-04 09:17:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:17:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2025-03-04 09:17:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.411764705882353) internal successors, (75), 18 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:17:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2025-03-04 09:17:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 09:17:59,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:17:59,877 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:17:59,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:18:00,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 09:18:00,078 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:18:00,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:18:00,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1036842590, now seen corresponding path program 1 times [2025-03-04 09:18:00,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:18:00,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321282918] [2025-03-04 09:18:00,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:18:00,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 09:18:00,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 09:18:00,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:00,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:18:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:18:01,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321282918] [2025-03-04 09:18:01,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321282918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:18:01,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121000495] [2025-03-04 09:18:01,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:01,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:18:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:18:01,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:18:01,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 09:18:01,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 09:18:01,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 09:18:01,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:01,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:01,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:18:01,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:18:01,695 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 09:18:01,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 09:18:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 09:18:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:18:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:18:01,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2025-03-04 09:18:01,826 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 09:18:01,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 09:18:02,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:18:02,718 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 09:18:02,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2025-03-04 09:18:02,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:18:02,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:18:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:18:02,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:18:03,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 09:18:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-03-04 09:18:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:18:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121000495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:18:03,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:18:03,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-03-04 09:18:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670906621] [2025-03-04 09:18:03,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:18:03,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 09:18:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:18:03,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 09:18:03,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2025-03-04 09:18:03,825 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:18:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 09:18:04,345 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2025-03-04 09:18:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:18:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-04 09:18:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 09:18:04,346 INFO L225 Difference]: With dead ends: 173 [2025-03-04 09:18:04,346 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 09:18:04,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-03-04 09:18:04,347 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 247 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 09:18:04,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 194 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 09:18:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 09:18:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2025-03-04 09:18:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:18:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2025-03-04 09:18:04,353 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 110 [2025-03-04 09:18:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 09:18:04,353 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2025-03-04 09:18:04,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 24 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 09:18:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2025-03-04 09:18:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 09:18:04,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 09:18:04,354 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:18:04,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 09:18:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 09:18:04,554 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 113 more)] === [2025-03-04 09:18:04,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:18:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -854274851, now seen corresponding path program 1 times [2025-03-04 09:18:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:18:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372631881] [2025-03-04 09:18:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:18:04,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 09:18:04,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 09:18:04,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:04,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-04 09:18:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:18:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372631881] [2025-03-04 09:18:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372631881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:18:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894792715] [2025-03-04 09:18:08,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:18:08,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:18:08,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:18:08,177 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:18:08,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 09:18:08,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 09:18:08,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 09:18:08,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:18:08,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:18:08,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-04 09:18:08,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:18:08,601 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 10 treesize of output 8 [2025-03-04 09:18:08,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 09:18:08,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 09:18:08,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 09:18:08,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 09:18:08,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:18:08,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 09:18:08,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 09:18:08,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 09:18:08,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2025-03-04 09:18:08,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 09:18:08,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:08,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:08,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:08,950 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:08,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:08,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:08,998 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:08,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,050 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,098 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,148 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,250 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,404 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 09:18:09,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-04 09:18:09,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-04 09:18:09,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 09:18:09,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-03-04 09:18:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-03-04 09:18:09,520 INFO L312 TraceCheckSpWp]: Computing backward predicates...