./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/realpath-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/realpath-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:42:44,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:42:44,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:42:44,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:42:44,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:42:44,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:42:44,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:42:44,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:42:44,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:42:44,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:42:44,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:42:44,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:42:44,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:42:44,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:42:44,629 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:42:44,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:42:44,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:42:44,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:42:44,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:42:44,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:44,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:42:44,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:42:44,632 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05679b26723da7fefe43df743638bd07f7ab18e951e1a83e76570c1072d39492 [2025-02-08 07:42:44,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:42:44,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:42:44,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:42:44,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:42:44,882 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:42:44,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-02-08 07:42:46,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dc2ea8c1/8a9d3721c5c14a9fbc631e0d383e331d/FLAG61e3dc630 [2025-02-08 07:42:46,447 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:42:46,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-02-08 07:42:46,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dc2ea8c1/8a9d3721c5c14a9fbc631e0d383e331d/FLAG61e3dc630 [2025-02-08 07:42:46,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3dc2ea8c1/8a9d3721c5c14a9fbc631e0d383e331d [2025-02-08 07:42:46,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:42:46,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:42:46,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:46,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:42:46,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:42:46,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:46" (1/1) ... [2025-02-08 07:42:46,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327e757c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:46, skipping insertion in model container [2025-02-08 07:42:46,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:42:46" (1/1) ... [2025-02-08 07:42:46,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:42:47,290 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,295 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,297 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,298 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,299 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,299 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,300 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,300 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,300 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,302 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,308 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,311 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,312 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,314 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,315 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,315 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,316 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,321 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,323 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,329 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:42:47,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:47,370 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:42:47,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:42:47,555 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 07:42:47,560 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:42:47,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47 WrapperNode [2025-02-08 07:42:47,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:42:47,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:47,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:42:47,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:42:47,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,634 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 827 [2025-02-08 07:42:47,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:42:47,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:42:47,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:42:47,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:42:47,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,663 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 07:42:47,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:42:47,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:42:47,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:42:47,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:42:47,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (1/1) ... [2025-02-08 07:42:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:42:47,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:47,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:42:47,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:42:47,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:42:47,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 07:42:47,767 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:42:47,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 07:42:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:42:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:42:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 07:42:47,768 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 07:42:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 07:42:47,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 07:42:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:42:47,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:42:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:42:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 07:42:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 07:42:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 07:42:48,034 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:42:48,036 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:42:48,446 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2389: full_write_#t~ret112#1 := safe_write_#res#1;havoc safe_write_#t~ret120#1, safe_write_#t~mem121#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret112#1 && full_write_#t~ret112#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret112#1;havoc full_write_#t~ret112#1; [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: assume full_write_~cc~0#1 < 0; [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: assume !(full_write_~cc~0#1 < 0);full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2357: #t~ret103#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet109#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret103#1 && #t~ret103#1 <= 2147483647;havoc #t~ret103#1; [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: #t~ret105#1 := full_write_#res#1;havoc full_write_#t~ret112#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret105#1 && #t~ret105#1 <= 9223372036854775807;havoc #t~mem104#1.base, #t~mem104#1.offset;havoc #t~ret105#1; [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-2: SUMMARY for call #t~mem104#1.base, #t~mem104#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8); srcloc: null [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-2: assume !(1 == #valid[~#msg~0#1.base]); [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-2: assume !(8 + ~#msg~0#1.offset <= #length[~#msg~0#1.base] && 0 <= ~#msg~0#1.offset); [2025-02-08 07:42:48,447 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358-1: assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem104#1.base, #t~mem104#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret112#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet159#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet159#1;assume -9223372036854775808 <= write_#t~nondet159#1 && write_#t~nondet159#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet159#1;havoc write_#t~nondet159#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434: assume !true; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2434-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: write_#res#1 := write_~ret~1#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: safe_write_#t~ret120#1 := write_#res#1;havoc write_#t~nondet159#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret120#1 && safe_write_#t~ret120#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret120#1;havoc safe_write_#t~ret120#1; [2025-02-08 07:42:48,448 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret120#1, safe_write_#t~mem121#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~0#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~0#1; [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437: assume safe_write_~n~0#1 < 0; [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem121#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-1: SUMMARY for call safe_write_#t~mem121#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:48,449 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422: assume { :begin_inline_bb_simple_perror_msg } true;bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset := __main_#t~mem117#1.base, __main_#t~mem117#1.offset;havoc bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset := bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;call bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset := #Ultimate.allocOnHeap(8); [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422-1: SUMMARY for call __main_#t~mem117#1.base, __main_#t~mem117#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422-1: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2422-1: assume !(8 + __main_~argv#1.offset <= #length[__main_~argv#1.base] && 0 <= __main_~argv#1.offset); [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !(__main_~resolved_path~0#1.base == 0 && __main_~resolved_path~0#1.offset == 0);havoc __main_#t~ret116#1;havoc __main_#t~ret116#1; [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !!(__main_~resolved_path~0#1.base == 0 && __main_~resolved_path~0#1.offset == 0);__main_~retval~0#1 := 1; [2025-02-08 07:42:49,116 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2258: SUMMARY for call bb_verror_msg(bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset); srcloc: null [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2424: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~resolved_path~0#1.base, __main_~resolved_path~0#1.offset; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-1: assume bb_perror_msg_~p~0#1.base < #StackHeapBarrier; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-1: assume !(bb_perror_msg_~p~0#1.base < #StackHeapBarrier); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259: assume 0 == bb_perror_msg_~p~0#1.base || 1 == #valid[bb_perror_msg_~p~0#1.base];call ULTIMATE.dealloc(bb_perror_msg_~p~0#1.base, 0);havoc bb_perror_msg_#t~mem75#1, bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset, bb_perror_msg_#t~nondet77#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;havoc bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;assume { :end_inline_bb_perror_msg } true;havoc bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset;havoc bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;havoc bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;assume { :end_inline_bb_simple_perror_msg } true;havoc __main_#t~mem117#1.base, __main_#t~mem117#1.offset; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259: assume !(0 == bb_perror_msg_~p~0#1.base || 1 == #valid[bb_perror_msg_~p~0#1.base]); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-2: assume true; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-2: assume !true; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284: assume { :begin_inline_bb_perror_msg } true;bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset := 4, 0, bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset;havoc bb_perror_msg_#t~mem75#1, bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset, bb_perror_msg_#t~nondet77#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset := bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset;havoc bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset;bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset := bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;havoc bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2251-1: SUMMARY for call bb_perror_msg_#t~mem75#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); srcloc: null [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2251-1: assume !(1 == #valid[~bb_errno~0.base]); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2251-1: assume !(4 + ~bb_errno~0.offset <= #length[~bb_errno~0.base] && 0 <= ~bb_errno~0.offset); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2251: assume !(0 == bb_perror_msg_#t~mem75#1);havoc bb_perror_msg_#t~mem75#1; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2251: assume !!(0 == bb_perror_msg_#t~mem75#1);havoc bb_perror_msg_#t~mem75#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := 0, 0; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284-1: SUMMARY for call write~$Pointer$(bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset, bb_simple_perror_msg_#t~varargs81#1.base, bb_simple_perror_msg_#t~varargs81#1.offset, 8); srcloc: null [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284-1: assume !(1 == #valid[bb_simple_perror_msg_#t~varargs81#1.base]); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2284-1: assume !(8 + bb_simple_perror_msg_#t~varargs81#1.offset <= #length[bb_simple_perror_msg_#t~varargs81#1.base] && 0 <= bb_simple_perror_msg_#t~varargs81#1.offset); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2458: xmalloc_realpath_#t~ret123#1.base, xmalloc_realpath_#t~ret123#1.offset := realpath_#res#1.base, realpath_#res#1.offset;havoc realpath_#t~nondet124#1, realpath_#t~nondet125#1, realpath_#t~malloc126#1.base, realpath_#t~malloc126#1.offset, realpath_~path#1.base, realpath_~path#1.offset, realpath_~resolved_path#1.base, realpath_~resolved_path#1.offset, realpath_~offset~0#1;havoc realpath_#in~path#1.base, realpath_#in~path#1.offset, realpath_#in~resolved_path#1.base, realpath_#in~resolved_path#1.offset;assume { :end_inline_realpath } true;xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset := xmalloc_realpath_#t~ret123#1.base, xmalloc_realpath_#t~ret123#1.offset;havoc xmalloc_realpath_#t~ret123#1.base, xmalloc_realpath_#t~ret123#1.offset;xmalloc_realpath_#res#1.base, xmalloc_realpath_#res#1.offset := xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-1: assume __main_~resolved_path~0#1.base < #StackHeapBarrier; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-1: assume !(__main_~resolved_path~0#1.base < #StackHeapBarrier); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417: assume 0 == __main_~resolved_path~0#1.base || 1 == #valid[__main_~resolved_path~0#1.base];call ULTIMATE.dealloc(__main_~resolved_path~0#1.base, __main_~resolved_path~0#1.offset); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417: assume !(0 == __main_~resolved_path~0#1.base || 1 == #valid[__main_~resolved_path~0#1.base]); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-2: assume 0 == __main_~resolved_path~0#1.offset; [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-2: assume !(0 == __main_~resolved_path~0#1.offset); [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426: SUMMARY for call __main_#t~mem118#1.base, __main_#t~mem118#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); srcloc: null [2025-02-08 07:42:49,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426: assume !(1 == #valid[__main_~argv#1.base]); [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426: assume !(8 + __main_~argv#1.offset <= #length[__main_~argv#1.base] && 0 <= __main_~argv#1.offset); [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253-1: SUMMARY for call write~int(0, bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet77#1 % 18446744073709551616 - 1, 1); srcloc: null [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253-1: assume !(1 == #valid[bb_perror_msg_#t~nondet76#1.base]); [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253-1: assume !(1 + (bb_perror_msg_#t~nondet77#1 % 18446744073709551616 - 1) <= #length[bb_perror_msg_#t~nondet76#1.base] && 0 <= bb_perror_msg_#t~nondet77#1 % 18446744073709551616 - 1); [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253: bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset := bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset;havoc bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset;havoc bb_perror_msg_#t~nondet77#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253-2: assume true;bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset := 0, 0; [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2253-2: assume true;havoc bb_perror_msg_#t~nondet77#1;assume bb_perror_msg_#t~nondet77#1 % 18446744073709551616 > 0;call bb_perror_msg_#t~nondet76#1.base, bb_perror_msg_#t~nondet76#1.offset := #Ultimate.allocOnHeap(bb_perror_msg_#t~nondet77#1 % 18446744073709551616); [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: assume !(__main_#t~mem118#1.base == 0 && __main_#t~mem118#1.offset == 0);havoc __main_#t~mem118#1.base, __main_#t~mem118#1.offset; [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: assume !!(__main_#t~mem118#1.base == 0 && __main_#t~mem118#1.offset == 0);havoc __main_#t~mem118#1.base, __main_#t~mem118#1.offset; [2025-02-08 07:42:49,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2413: __main_#t~ret115#1.base, __main_#t~ret115#1.offset := xmalloc_realpath_#res#1.base, xmalloc_realpath_#res#1.offset;havoc xmalloc_realpath_#t~ret123#1.base, xmalloc_realpath_#t~ret123#1.offset, xmalloc_realpath_~path#1.base, xmalloc_realpath_~path#1.offset, xmalloc_realpath_~return_value_realpath$1~0#1.base, xmalloc_realpath_~return_value_realpath$1~0#1.offset;havoc xmalloc_realpath_#in~path#1.base, xmalloc_realpath_#in~path#1.offset;assume { :end_inline_xmalloc_realpath } true;__main_~resolved_path~0#1.base, __main_~resolved_path~0#1.offset := __main_#t~ret115#1.base, __main_#t~ret115#1.offset;havoc __main_#t~mem114#1.base, __main_#t~mem114#1.offset;havoc __main_#t~ret115#1.base, __main_#t~ret115#1.offset; [2025-02-08 07:42:49,171 INFO L? ?]: Removed 288 outVars from TransFormulas that were not future-live. [2025-02-08 07:42:49,172 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:42:49,192 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:42:49,192 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:42:49,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:49 BoogieIcfgContainer [2025-02-08 07:42:49,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:42:49,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:42:49,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:42:49,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:42:49,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:42:46" (1/3) ... [2025-02-08 07:42:49,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ab327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:49, skipping insertion in model container [2025-02-08 07:42:49,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:42:47" (2/3) ... [2025-02-08 07:42:49,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ab327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:42:49, skipping insertion in model container [2025-02-08 07:42:49,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:42:49" (3/3) ... [2025-02-08 07:42:49,202 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-1.i [2025-02-08 07:42:49,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:42:49,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-1.i that has 4 procedures, 250 locations, 1 initial locations, 13 loop locations, and 125 error locations. [2025-02-08 07:42:49,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:42:49,256 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;@55cf0740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:42:49,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-02-08 07:42:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 55 states have (on average 1.981818181818182) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:49,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:49,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:49,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:49,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 12511, now seen corresponding path program 1 times [2025-02-08 07:42:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036237264] [2025-02-08 07:42:49,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:49,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:49,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:49,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:49,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:49,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036237264] [2025-02-08 07:42:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036237264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:49,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:49,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265698715] [2025-02-08 07:42:49,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:49,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:49,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:49,942 INFO L87 Difference]: Start difference. First operand has 105 states, 55 states have (on average 1.981818181818182) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:50,020 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-02-08 07:42:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:50,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:42:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:50,026 INFO L225 Difference]: With dead ends: 68 [2025-02-08 07:42:50,026 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 07:42:50,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:50,031 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:50,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 44 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 07:42:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 07:42:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-02-08 07:42:50,060 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 2 [2025-02-08 07:42:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:50,060 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-02-08 07:42:50,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-02-08 07:42:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:42:50,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:50,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:42:50,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:42:50,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:50,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash 12512, now seen corresponding path program 1 times [2025-02-08 07:42:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492162217] [2025-02-08 07:42:50,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:50,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:42:50,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:42:50,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:50,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:50,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:50,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492162217] [2025-02-08 07:42:50,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492162217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:50,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:42:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686216655] [2025-02-08 07:42:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:50,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:42:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:50,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:42:50,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:50,429 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:50,488 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-02-08 07:42:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:42:50,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:42:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:50,489 INFO L225 Difference]: With dead ends: 64 [2025-02-08 07:42:50,489 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 07:42:50,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:42:50,491 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:50,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 91 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 07:42:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 07:42:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-02-08 07:42:50,498 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 2 [2025-02-08 07:42:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-02-08 07:42:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-02-08 07:42:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:42:50,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:50,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:42:50,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:42:50,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:50,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 373039878, now seen corresponding path program 1 times [2025-02-08 07:42:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800072158] [2025-02-08 07:42:50,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:50,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:42:50,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:42:50,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:50,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800072158] [2025-02-08 07:42:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800072158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774671099] [2025-02-08 07:42:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:50,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:50,851 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:51,751 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2025-02-08 07:42:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:51,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 07:42:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:51,752 INFO L225 Difference]: With dead ends: 67 [2025-02-08 07:42:51,752 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 07:42:51,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:51,753 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:51,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:42:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 07:42:51,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-02-08 07:42:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.736842105263158) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2025-02-08 07:42:51,759 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 5 [2025-02-08 07:42:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:51,759 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2025-02-08 07:42:51,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2025-02-08 07:42:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:42:51,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:51,759 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:51,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:42:51,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2144066469, now seen corresponding path program 1 times [2025-02-08 07:42:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833811901] [2025-02-08 07:42:51,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:51,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:52,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:52,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833811901] [2025-02-08 07:42:52,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833811901] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286158694] [2025-02-08 07:42:52,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:52,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:52,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:42:52,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:42:52,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:42:52,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:52,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:52,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:42:52,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:52,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:52,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:42:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286158694] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:52,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:42:52,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561641005] [2025-02-08 07:42:52,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:52,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:42:52,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:52,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:42:52,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:42:52,705 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:54,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:54,943 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-02-08 07:42:54,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:42:54,943 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 07:42:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:54,944 INFO L225 Difference]: With dead ends: 70 [2025-02-08 07:42:54,944 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 07:42:54,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 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-02-08 07:42:54,945 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:54,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 247 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 07:42:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 07:42:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-02-08 07:42:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.627906976744186) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-02-08 07:42:54,948 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 8 [2025-02-08 07:42:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-02-08 07:42:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-02-08 07:42:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:42:54,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:54,948 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 07:42:54,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:42:55,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:55,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1166273574, now seen corresponding path program 1 times [2025-02-08 07:42:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820260251] [2025-02-08 07:42:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:42:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:42:55,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 07:42:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820260251] [2025-02-08 07:42:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820260251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:42:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836468671] [2025-02-08 07:42:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:42:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:55,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:42:55,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:55,543 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:55,601 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-02-08 07:42:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:55,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 07:42:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:55,602 INFO L225 Difference]: With dead ends: 69 [2025-02-08 07:42:55,602 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 07:42:55,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:42:55,603 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:55,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 41 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 07:42:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 07:42:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-02-08 07:42:55,609 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 14 [2025-02-08 07:42:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:55,611 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-02-08 07:42:55,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-02-08 07:42:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:42:55,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:55,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-02-08 07:42:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:42:55,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1166273573, now seen corresponding path program 1 times [2025-02-08 07:42:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347573719] [2025-02-08 07:42:55,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:55,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:42:55,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:42:55,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:55,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347573719] [2025-02-08 07:42:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347573719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:42:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028830977] [2025-02-08 07:42:55,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:42:55,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:42:55,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:42:56,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:42:56,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:42:56,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:56,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:56,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:42:56,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:42:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:56,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:42:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:42:56,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028830977] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:42:56,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:42:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 07:42:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241436169] [2025-02-08 07:42:56,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:42:56,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:42:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:56,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:42:56,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:42:56,255 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:58,987 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-02-08 07:42:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:42:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 14 [2025-02-08 07:42:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:58,990 INFO L225 Difference]: With dead ends: 84 [2025-02-08 07:42:58,992 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 07:42:58,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:42:58,992 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:58,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 303 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 07:42:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 07:42:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 07:42:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 80 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-02-08 07:42:58,999 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 14 [2025-02-08 07:42:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:58,999 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-02-08 07:42:58,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-02-08 07:42:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 07:42:58,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:58,999 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2025-02-08 07:42:59,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:42:59,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:42:59,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:59,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 927056358, now seen corresponding path program 2 times [2025-02-08 07:42:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822708221] [2025-02-08 07:42:59,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:42:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:59,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-08 07:42:59,307 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 29 statements. [2025-02-08 07:42:59,307 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:42:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:42:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 07:42:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:42:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822708221] [2025-02-08 07:42:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822708221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:42:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:42:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:42:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030682502] [2025-02-08 07:42:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:42:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:42:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:42:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:42:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:59,512 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:42:59,567 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2025-02-08 07:42:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:42:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 07:42:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:42:59,568 INFO L225 Difference]: With dead ends: 87 [2025-02-08 07:42:59,569 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 07:42:59,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:42:59,569 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:42:59,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:42:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 07:42:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 07:42:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:42:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-02-08 07:42:59,573 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 29 [2025-02-08 07:42:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:42:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-02-08 07:42:59,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:42:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-02-08 07:42:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 07:42:59,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:42:59,574 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:42:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:42:59,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:42:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:42:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2042489654, now seen corresponding path program 1 times [2025-02-08 07:42:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:42:59,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134302093] [2025-02-08 07:42:59,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:42:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:42:59,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 07:42:59,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 07:42:59,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:42:59,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134302093] [2025-02-08 07:43:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134302093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695847911] [2025-02-08 07:43:00,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:00,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:00,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:00,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:00,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:43:00,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 07:43:00,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 07:43:00,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:00,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:00,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 07:43:00,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:00,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:43:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695847911] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:00,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:00,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-08 07:43:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379527552] [2025-02-08 07:43:00,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:43:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:00,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:43:00,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:43:00,517 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:43:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:01,570 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2025-02-08 07:43:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:43:01,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 07:43:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:01,572 INFO L225 Difference]: With dead ends: 93 [2025-02-08 07:43:01,572 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 07:43:01,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:43:01,573 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:01,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:43:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 07:43:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 07:43:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.373134328358209) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2025-02-08 07:43:01,581 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 37 [2025-02-08 07:43:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:01,581 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2025-02-08 07:43:01,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:43:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2025-02-08 07:43:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:43:01,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:01,582 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:01,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 07:43:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:01,783 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:01,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 466983082, now seen corresponding path program 2 times [2025-02-08 07:43:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457623792] [2025-02-08 07:43:01,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:01,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-08 07:43:01,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-02-08 07:43:01,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:43:01,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457623792] [2025-02-08 07:43:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457623792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:02,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:02,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:43:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264272481] [2025-02-08 07:43:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:02,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:02,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:02,035 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:02,620 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-02-08 07:43:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-02-08 07:43:02,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:02,621 INFO L225 Difference]: With dead ends: 88 [2025-02-08 07:43:02,621 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 07:43:02,621 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-02-08 07:43:02,621 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:02,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 46 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:43:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 07:43:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 07:43:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-02-08 07:43:02,626 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 43 [2025-02-08 07:43:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-02-08 07:43:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-02-08 07:43:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 07:43:02,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:02,628 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:43:02,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 466983083, now seen corresponding path program 1 times [2025-02-08 07:43:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479466071] [2025-02-08 07:43:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:02,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 07:43:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 07:43:02,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:02,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479466071] [2025-02-08 07:43:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479466071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:43:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860999138] [2025-02-08 07:43:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:03,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:03,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:03,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:03,413 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:03,848 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-02-08 07:43:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:43:03,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-02-08 07:43:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:03,850 INFO L225 Difference]: With dead ends: 103 [2025-02-08 07:43:03,850 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 07:43:03,850 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-02-08 07:43:03,851 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 128 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:03,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 166 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:43:03,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 07:43:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2025-02-08 07:43:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-02-08 07:43:03,856 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 43 [2025-02-08 07:43:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:03,856 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-02-08 07:43:03,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:43:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-02-08 07:43:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:43:03,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:03,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:43:03,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 494232907, now seen corresponding path program 1 times [2025-02-08 07:43:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497366334] [2025-02-08 07:43:03,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:03,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:43:03,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:43:03,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:03,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497366334] [2025-02-08 07:43:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497366334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:04,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:04,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:43:04,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344820480] [2025-02-08 07:43:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:43:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:04,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:43:04,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:43:04,216 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:43:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:06,327 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2025-02-08 07:43:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:43:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:43:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:06,328 INFO L225 Difference]: With dead ends: 106 [2025-02-08 07:43:06,328 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 07:43:06,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-02-08 07:43:06,329 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 95 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 07:43:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 07:43:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2025-02-08 07:43:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 96 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2025-02-08 07:43:06,332 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 46 [2025-02-08 07:43:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:06,332 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2025-02-08 07:43:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:43:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2025-02-08 07:43:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:43:06,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:06,332 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:43:06,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 494231978, now seen corresponding path program 1 times [2025-02-08 07:43:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48484642] [2025-02-08 07:43:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:06,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:43:06,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:43:06,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:06,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48484642] [2025-02-08 07:43:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48484642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:43:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336879573] [2025-02-08 07:43:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:43:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:06,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:43:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:43:06,582 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-02-08 07:43:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:07,556 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2025-02-08 07:43:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:43:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 46 [2025-02-08 07:43:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:07,558 INFO L225 Difference]: With dead ends: 99 [2025-02-08 07:43:07,559 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 07:43:07,559 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-02-08 07:43:07,559 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:07,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 69 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:43:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 07:43:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 07:43:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 94 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-02-08 07:43:07,566 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 46 [2025-02-08 07:43:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:07,567 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-02-08 07:43:07,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-02-08 07:43:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-02-08 07:43:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 07:43:07,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:07,567 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:43:07,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:43:07,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:07,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 494231979, now seen corresponding path program 1 times [2025-02-08 07:43:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:07,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434708525] [2025-02-08 07:43:07,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:07,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 07:43:07,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 07:43:07,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:07,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434708525] [2025-02-08 07:43:07,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434708525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:07,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:07,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:43:07,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752579485] [2025-02-08 07:43:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:07,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:43:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:07,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:43:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:43:07,925 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:43:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:08,969 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-02-08 07:43:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:08,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2025-02-08 07:43:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:08,970 INFO L225 Difference]: With dead ends: 104 [2025-02-08 07:43:08,970 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 07:43:08,970 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-02-08 07:43:08,971 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:08,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 169 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:43:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 07:43:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-02-08 07:43:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 94 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-02-08 07:43:08,973 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2025-02-08 07:43:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-02-08 07:43:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-02-08 07:43:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-02-08 07:43:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:43:08,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:08,976 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] [2025-02-08 07:43:08,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:43:08,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:08,976 INFO L85 PathProgramCache]: Analyzing trace with hash 544915717, now seen corresponding path program 1 times [2025-02-08 07:43:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027576421] [2025-02-08 07:43:08,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:09,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:43:09,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:43:09,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:09,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027576421] [2025-02-08 07:43:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027576421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:43:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80653053] [2025-02-08 07:43:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:09,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:09,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:09,242 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-08 07:43:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:09,858 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-02-08 07:43:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-02-08 07:43:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:09,859 INFO L225 Difference]: With dead ends: 98 [2025-02-08 07:43:09,859 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 07:43:09,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:09,859 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:09,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 50 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:43:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 07:43:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 07:43:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.271604938271605) internal successors, (103), 93 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-02-08 07:43:09,861 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 49 [2025-02-08 07:43:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:09,861 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-02-08 07:43:09,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-02-08 07:43:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-02-08 07:43:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 07:43:09,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:09,862 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] [2025-02-08 07:43:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:43:09,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:09,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash 544915718, now seen corresponding path program 1 times [2025-02-08 07:43:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638303856] [2025-02-08 07:43:09,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:09,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 07:43:09,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 07:43:09,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638303856] [2025-02-08 07:43:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638303856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:43:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978623756] [2025-02-08 07:43:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:10,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:10,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:10,552 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-02-08 07:43:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:12,749 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2025-02-08 07:43:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:43:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 49 [2025-02-08 07:43:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:12,750 INFO L225 Difference]: With dead ends: 116 [2025-02-08 07:43:12,750 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 07:43:12,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:43:12,750 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:12,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 101 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-08 07:43:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 07:43:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2025-02-08 07:43:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-02-08 07:43:12,757 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 49 [2025-02-08 07:43:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-02-08 07:43:12,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-02-08 07:43:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-02-08 07:43:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:43:12,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:12,758 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] [2025-02-08 07:43:12,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:43:12,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:12,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1391956925, now seen corresponding path program 1 times [2025-02-08 07:43:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797513839] [2025-02-08 07:43:12,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:12,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:43:12,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:43:12,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:12,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:13,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797513839] [2025-02-08 07:43:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797513839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:13,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:13,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:43:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434724337] [2025-02-08 07:43:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:13,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:13,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:13,226 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:43:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:14,615 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-02-08 07:43:14,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:14,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:43:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:14,616 INFO L225 Difference]: With dead ends: 97 [2025-02-08 07:43:14,616 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 07:43:14,616 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-02-08 07:43:14,616 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:14,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:43:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 07:43:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 07:43:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-02-08 07:43:14,619 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 52 [2025-02-08 07:43:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:14,619 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-02-08 07:43:14,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:43:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-02-08 07:43:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 07:43:14,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:14,620 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] [2025-02-08 07:43:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:43:14,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1391956924, now seen corresponding path program 1 times [2025-02-08 07:43:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018324581] [2025-02-08 07:43:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:14,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 07:43:14,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 07:43:14,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:14,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018324581] [2025-02-08 07:43:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018324581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:15,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:43:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687585933] [2025-02-08 07:43:15,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:15,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:15,219 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:43:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:17,640 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-02-08 07:43:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 52 [2025-02-08 07:43:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:17,641 INFO L225 Difference]: With dead ends: 96 [2025-02-08 07:43:17,641 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 07:43:17,642 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-02-08 07:43:17,642 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:17,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 150 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:43:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 07:43:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 07:43:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-02-08 07:43:17,645 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 52 [2025-02-08 07:43:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:17,646 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-02-08 07:43:17,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-08 07:43:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-02-08 07:43:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 07:43:17,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:17,646 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] [2025-02-08 07:43:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:43:17,647 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash -550791049, now seen corresponding path program 1 times [2025-02-08 07:43:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982089399] [2025-02-08 07:43:17,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:17,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 07:43:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 07:43:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982089399] [2025-02-08 07:43:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982089399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:17,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:43:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778970278] [2025-02-08 07:43:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:43:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:17,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:43:17,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:17,815 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-08 07:43:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:18,188 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-02-08 07:43:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:43:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 56 [2025-02-08 07:43:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:18,190 INFO L225 Difference]: With dead ends: 108 [2025-02-08 07:43:18,190 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 07:43:18,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:43:18,190 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:18,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:43:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 07:43:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2025-02-08 07:43:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 93 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-02-08 07:43:18,193 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 56 [2025-02-08 07:43:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:18,193 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-02-08 07:43:18,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-02-08 07:43:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-02-08 07:43:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:43:18,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:18,193 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] [2025-02-08 07:43:18,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:43:18,193 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:18,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash 105593275, now seen corresponding path program 1 times [2025-02-08 07:43:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:18,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380577864] [2025-02-08 07:43:18,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:18,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:43:18,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:43:18,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:18,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380577864] [2025-02-08 07:43:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380577864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 07:43:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063766433] [2025-02-08 07:43:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:18,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 07:43:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:18,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 07:43:18,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-08 07:43:18,752 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-02-08 07:43:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:20,611 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-02-08 07:43:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:43:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-02-08 07:43:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:20,612 INFO L225 Difference]: With dead ends: 105 [2025-02-08 07:43:20,612 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 07:43:20,613 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-02-08 07:43:20,613 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:20,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 136 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:43:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 07:43:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-02-08 07:43:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 99 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2025-02-08 07:43:20,615 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 57 [2025-02-08 07:43:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2025-02-08 07:43:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-02-08 07:43:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2025-02-08 07:43:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 07:43:20,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:20,616 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] [2025-02-08 07:43:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:43:20,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 105593276, now seen corresponding path program 1 times [2025-02-08 07:43:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004588242] [2025-02-08 07:43:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:20,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 07:43:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 07:43:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004588242] [2025-02-08 07:43:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004588242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:43:21,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:43:21,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:43:21,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783827875] [2025-02-08 07:43:21,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:43:21,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:43:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:21,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:43:21,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:43:21,485 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-02-08 07:43:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:24,711 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2025-02-08 07:43:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:43:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-02-08 07:43:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:24,715 INFO L225 Difference]: With dead ends: 104 [2025-02-08 07:43:24,715 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 07:43:24,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:43:24,716 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:24,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-08 07:43:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 07:43:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 07:43:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.202247191011236) internal successors, (107), 99 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-02-08 07:43:24,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 57 [2025-02-08 07:43:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:24,718 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-02-08 07:43:24,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 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-02-08 07:43:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-02-08 07:43:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 07:43:24,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:24,719 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] [2025-02-08 07:43:24,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:43:24,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:24,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 383177368, now seen corresponding path program 1 times [2025-02-08 07:43:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:24,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280476967] [2025-02-08 07:43:24,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:43:24,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:43:24,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:24,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:24,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280476967] [2025-02-08 07:43:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280476967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148700090] [2025-02-08 07:43:24,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:24,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:24,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:24,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:43:25,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 07:43:25,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 07:43:25,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:25,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:43:25,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:25,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148700090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:25,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:43:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931272883] [2025-02-08 07:43:25,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:43:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:25,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:43:25,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:25,376 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-02-08 07:43:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:26,833 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-02-08 07:43:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:43:26,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-02-08 07:43:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:26,834 INFO L225 Difference]: With dead ends: 133 [2025-02-08 07:43:26,835 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 07:43:26,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:43:26,836 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:26,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 191 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:43:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 07:43:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2025-02-08 07:43:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.247787610619469) internal successors, (141), 123 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2025-02-08 07:43:26,840 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 61 [2025-02-08 07:43:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:26,840 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2025-02-08 07:43:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-02-08 07:43:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2025-02-08 07:43:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:43:26,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:26,840 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] [2025-02-08 07:43:26,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:43:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 07:43:27,041 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:27,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1006156870, now seen corresponding path program 1 times [2025-02-08 07:43:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:27,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132424622] [2025-02-08 07:43:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:27,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:43:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:43:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132424622] [2025-02-08 07:43:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132424622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408137491] [2025-02-08 07:43:27,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:27,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:27,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:27,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:27,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:43:27,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:43:28,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:43:28,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:28,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:28,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:43:28,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:28,084 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-02-08 07:43:28,109 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:28,109 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-02-08 07:43:28,121 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-02-08 07:43:28,140 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 21 treesize of output 16 [2025-02-08 07:43:28,164 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:28,164 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-02-08 07:43:28,211 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:28,211 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-02-08 07:43:28,222 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-02-08 07:43:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 07:43:28,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:28,319 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-02-08 07:43:28,319 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 37 treesize of output 36 [2025-02-08 07:43:28,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4775 (Array Int Int)) (v_ArrVal_4776 (Array Int Int))) (= (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~mem169#1.base| v_ArrVal_4775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4776)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem169#1.base|)) is different from false [2025-02-08 07:43:28,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4775 (Array Int Int)) (v_ArrVal_4776 (Array Int Int))) (let ((.cse1 (+ (* |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|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4776)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2)))) is different from false [2025-02-08 07:43:28,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:28,399 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 127 treesize of output 80 [2025-02-08 07:43:28,408 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 4712 treesize of output 3904 [2025-02-08 07:43:28,422 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 144 treesize of output 102 [2025-02-08 07:43:28,425 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 102 treesize of output 84 [2025-02-08 07:43:28,429 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 42 treesize of output 24 [2025-02-08 07:43:28,498 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:43:28,498 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-02-08 07:43:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408137491] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:28,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2025-02-08 07:43:28,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156347607] [2025-02-08 07:43:28,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:28,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:43:28,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:28,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:43:28,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=240, Unknown=17, NotChecked=66, Total=380 [2025-02-08 07:43:28,506 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-02-08 07:43:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:33,919 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2025-02-08 07:43:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:43:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-02-08 07:43:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:33,920 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:43:33,920 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:43:33,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=385, Unknown=18, NotChecked=86, Total=600 [2025-02-08 07:43:33,923 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:33,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 263 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 81 Unchecked, 5.3s Time] [2025-02-08 07:43:33,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:43:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 07:43:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 122 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2025-02-08 07:43:33,926 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 62 [2025-02-08 07:43:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:33,926 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2025-02-08 07:43:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 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-02-08 07:43:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2025-02-08 07:43:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 07:43:33,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:33,926 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] [2025-02-08 07:43:33,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:43:34,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-08 07:43:34,132 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:34,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1006156869, now seen corresponding path program 1 times [2025-02-08 07:43:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:34,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854547262] [2025-02-08 07:43:34,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:34,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:34,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:43:34,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:43:34,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:34,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:35,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854547262] [2025-02-08 07:43:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854547262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802439890] [2025-02-08 07:43:35,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:43:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:35,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:35,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:43:35,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 07:43:35,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 07:43:35,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:43:35,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 07:43:35,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:35,543 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-02-08 07:43:35,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:43:35,563 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:35,563 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-02-08 07:43:35,586 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-02-08 07:43:35,590 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-02-08 07:43:35,632 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-02-08 07:43:35,636 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-02-08 07:43:35,700 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:35,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-02-08 07:43:35,706 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-02-08 07:43:35,783 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:35,783 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-02-08 07:43:35,788 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-02-08 07:43:35,826 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-02-08 07:43:35,829 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 11 treesize of output 3 [2025-02-08 07:43:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:35,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:35,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5222 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5223 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5223) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:43:35,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5222 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5223 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5223) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:35,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5223 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5223) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:35,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5220 (Array Int Int)) (v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5221 (Array Int Int)) (v_ArrVal_5223 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5220))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5221) .cse0 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5223) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5220 (Array Int Int)) (v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5221) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5220) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-02-08 07:43:36,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5220 (Array Int Int)) (v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5221 (Array Int Int)) (v_ArrVal_5219 (Array Int Int)) (v_ArrVal_5218 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5219))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5218) .cse0 v_ArrVal_5221) (select (select (store .cse1 .cse0 v_ArrVal_5220) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5222))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_5220 (Array Int Int)) (v_ArrVal_5222 (Array Int Int)) (v_ArrVal_5221 (Array Int Int)) (v_ArrVal_5223 (Array Int Int)) (v_ArrVal_5219 (Array Int Int)) (v_ArrVal_5218 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5219))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_5220))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5218) .cse3 v_ArrVal_5221) .cse4 v_ArrVal_5222) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_5223) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:43:36,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:36,094 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 107 [2025-02-08 07:43:36,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:36,098 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 94 treesize of output 71 [2025-02-08 07:43:36,102 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 454 treesize of output 374 [2025-02-08 07:43:36,109 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 2782 treesize of output 2646 [2025-02-08 07:43:36,120 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 146 treesize of output 122 [2025-02-08 07:43:36,122 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 122 treesize of output 110 [2025-02-08 07:43:36,124 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 110 treesize of output 98 [2025-02-08 07:43:36,127 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 57 treesize of output 45 [2025-02-08 07:43:36,131 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 45 treesize of output 39 [2025-02-08 07:43:36,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:36,156 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2025-02-08 07:43:36,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:36,163 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2025-02-08 07:43:36,166 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:36,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1102 treesize of output 694 [2025-02-08 07:43:36,174 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:36,174 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:36,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 12 [2025-02-08 07:43:36,259 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:43:36,259 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-02-08 07:43:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-02-08 07:43:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802439890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:36,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:36,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-02-08 07:43:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395634702] [2025-02-08 07:43:36,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:36,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 07:43:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:36,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 07:43:36,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=596, Unknown=10, NotChecked=270, Total=992 [2025-02-08 07:43:36,266 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 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-02-08 07:43:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:41,549 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2025-02-08 07:43:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:43:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 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) Word has length 62 [2025-02-08 07:43:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:41,550 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:43:41,550 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:43:41,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=915, Unknown=10, NotChecked=340, Total=1482 [2025-02-08 07:43:41,551 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:41,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 304 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 385 Invalid, 0 Unknown, 256 Unchecked, 5.0s Time] [2025-02-08 07:43:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:43:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 07:43:41,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.176991150442478) internal successors, (133), 122 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2025-02-08 07:43:41,554 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 62 [2025-02-08 07:43:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:41,554 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2025-02-08 07:43:41,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 32 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-02-08 07:43:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2025-02-08 07:43:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 07:43:41,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:41,554 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 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] [2025-02-08 07:43:41,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:43:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 07:43:41,755 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:41,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1250730268, now seen corresponding path program 2 times [2025-02-08 07:43:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:41,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026690957] [2025-02-08 07:43:41,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:41,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:43:41,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:43:41,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:43:41,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026690957] [2025-02-08 07:43:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026690957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684854366] [2025-02-08 07:43:43,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:43:43,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:43,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:43,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:43:43,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-08 07:43:45,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 07:43:45,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:43:45,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:45,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 07:43:45,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:43:45,373 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-02-08 07:43:45,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:43:45,386 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-02-08 07:43:45,391 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-02-08 07:43:45,417 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-02-08 07:43:45,421 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-02-08 07:43:45,467 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-02-08 07:43:45,474 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-02-08 07:43:45,535 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:45,536 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-02-08 07:43:45,541 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-02-08 07:43:45,648 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:45,649 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-02-08 07:43:45,658 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-02-08 07:43:45,755 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 07:43:45,756 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-02-08 07:43:45,762 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-02-08 07:43:45,816 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-02-08 07:43:45,820 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 11 treesize of output 3 [2025-02-08 07:43:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:45,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:43:45,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5683 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:43:45,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5683 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:45,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_5683 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:43:45,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5681) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5682) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5682))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5681) .cse1 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:43:45,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5681) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5682) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5682))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5681) .cse2 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:43:46,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5679))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5682))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5680) .cse0 v_ArrVal_5681) .cse1 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5679))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5680) .cse5 v_ArrVal_5681) (select (select (store .cse6 .cse5 v_ArrVal_5682) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5683))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2025-02-08 07:43:46,076 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 ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5679))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5680) .cse1 v_ArrVal_5681) (select (select (store .cse2 .cse1 v_ArrVal_5682) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5683))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5679))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5682))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5680) .cse4 v_ArrVal_5681) .cse5 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:43:46,101 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|))) (and (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5684 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5678))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_5679))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_5682))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ 3 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5677) .cse0 v_ArrVal_5680) .cse1 v_ArrVal_5681) .cse2 v_ArrVal_5683) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5684) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_5682 (Array Int Int)) (v_ArrVal_5681 (Array Int Int)) (v_ArrVal_5683 (Array Int Int)) (v_ArrVal_5677 (Array Int Int)) (v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5678))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5679))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5677) .cse7 v_ArrVal_5680) .cse8 v_ArrVal_5681) (select (select (store .cse9 .cse8 v_ArrVal_5682) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5683))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) is different from false [2025-02-08 07:43:46,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:46,134 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 417 treesize of output 418 [2025-02-08 07:43:46,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:46,139 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 405 treesize of output 238 [2025-02-08 07:43:46,158 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 613514 treesize of output 490130 [2025-02-08 07:43:46,730 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 161395 treesize of output 158955 [2025-02-08 07:43:46,845 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 1919 treesize of output 1607 [2025-02-08 07:43:46,852 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 1607 treesize of output 1511 [2025-02-08 07:43:46,861 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 1511 treesize of output 1415 [2025-02-08 07:43:46,878 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 1415 treesize of output 1367 [2025-02-08 07:43:46,885 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 1367 treesize of output 1103 [2025-02-08 07:43:46,892 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 1103 treesize of output 1055 [2025-02-08 07:43:46,900 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 1055 treesize of output 911 [2025-02-08 07:43:46,907 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 911 treesize of output 887 [2025-02-08 07:43:46,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:46,998 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-02-08 07:43:47,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:43:47,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-02-08 07:43:47,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:47,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 531 treesize of output 347 [2025-02-08 07:43:47,009 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:47,009 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:43:47,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2025-02-08 07:43:47,081 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 07:43:47,081 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-02-08 07:43:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 13 not checked. [2025-02-08 07:43:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684854366] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:43:47,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:43:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2025-02-08 07:43:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789004994] [2025-02-08 07:43:47,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:43:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 07:43:47,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:43:47,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 07:43:47,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=798, Unknown=13, NotChecked=520, Total=1482 [2025-02-08 07:43:47,090 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 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-02-08 07:43:51,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 07:43:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:43:53,847 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2025-02-08 07:43:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:43:53,848 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 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 67 [2025-02-08 07:43:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:43:53,849 INFO L225 Difference]: With dead ends: 127 [2025-02-08 07:43:53,850 INFO L226 Difference]: Without dead ends: 127 [2025-02-08 07:43:53,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=286, Invalid=1293, Unknown=13, NotChecked=664, Total=2256 [2025-02-08 07:43:53,857 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 116 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:43:53,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 330 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 457 Unchecked, 6.3s Time] [2025-02-08 07:43:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-08 07:43:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-08 07:43:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 122 states have internal predecessors, (131), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:43:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2025-02-08 07:43:53,866 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 67 [2025-02-08 07:43:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:43:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2025-02-08 07:43:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 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-02-08 07:43:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2025-02-08 07:43:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 07:43:53,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:43:53,868 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 3, 3, 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-02-08 07:43:53,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 07:43:54,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:54,069 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-08 07:43:54,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:43:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1734309979, now seen corresponding path program 3 times [2025-02-08 07:43:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:43:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917460263] [2025-02-08 07:43:54,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:43:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:43:54,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:43:54,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:43:54,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:43:54,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:43:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:43:55,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:43:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917460263] [2025-02-08 07:43:55,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917460263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:43:55,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929276828] [2025-02-08 07:43:55,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:43:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:43:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:43:55,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:43:55,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:43:56,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 72 statements into 11 equivalence classes. [2025-02-08 07:44:09,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 72 statements. [2025-02-08 07:44:09,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 07:44:09,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:44:09,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 07:44:09,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:44:09,693 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-02-08 07:44:09,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:44:09,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:44:09,759 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-02-08 07:44:09,788 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 11 treesize of output 7 [2025-02-08 07:44:09,794 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 15 treesize of output 1 [2025-02-08 07:44:09,867 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 26 treesize of output 19 [2025-02-08 07:44:09,870 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 16 treesize of output 11 [2025-02-08 07:44:09,941 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:09,942 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 45 [2025-02-08 07:44:09,947 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 24 treesize of output 11 [2025-02-08 07:44:10,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:10,047 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 45 [2025-02-08 07:44:10,053 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 24 treesize of output 11 [2025-02-08 07:44:10,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:10,159 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 45 [2025-02-08 07:44:10,165 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 24 treesize of output 11 [2025-02-08 07:44:10,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 07:44:10,284 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 45 [2025-02-08 07:44:10,290 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 24 treesize of output 11 [2025-02-08 07:44:10,377 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 25 treesize of output 13 [2025-02-08 07:44:10,379 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 7 treesize of output 3 [2025-02-08 07:44:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:44:10,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:44:11,145 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_6157 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6157))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 (+ (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6158) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2)) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse0) 0))))) (forall ((v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int)) (v_ArrVal_6160 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6157))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6158))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ (select (select (store .cse4 .cse5 v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6160) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-08 07:44:11,176 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_6155 (Array Int Int)) (v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6156 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_6156))) (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_#t~mem170#1.base| v_ArrVal_6155) .cse3 v_ArrVal_6157))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse0) 0) (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_6158) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2)))))))) (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6156 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int)) (v_ArrVal_6160 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_6156))) (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_#t~mem170#1.base| v_ArrVal_6155) .cse9 v_ArrVal_6157))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_6158))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse5 .cse6 v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_6160) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) is different from false [2025-02-08 07:44:11,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6154 (Array Int Int)) (v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6156 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int)) (v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6153 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_6153))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_6156))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_6154) .cse6 v_ArrVal_6155) .cse5 v_ArrVal_6157))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_6158))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ 3 (select (select (store .cse0 .cse1 v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6160) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))))) (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6154 (Array Int Int)) (v_ArrVal_6157 (Array Int Int)) (v_ArrVal_6156 (Array Int Int)) (v_ArrVal_6159 (Array Int Int)) (v_ArrVal_6158 (Array Int Int)) (v_ArrVal_6153 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_6153))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_6156))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_6154) .cse12 v_ArrVal_6155) .cse11 v_ArrVal_6157))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse8 (+ 2 (select (select (store .cse9 (select (select (store .cse10 .cse11 v_ArrVal_6158) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_6159) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ 2 .cse8) 0))))))))))) is different from false