./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/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-?-551b009-m [2025-01-10 00:07:42,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:07:42,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:07:42,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:07:42,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:07:42,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:07:42,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:07:42,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:07:42,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:07:42,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:07:42,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:07:42,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:07:42,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:07:42,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:07:42,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:07:42,466 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:07:42,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:42,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:42,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:42,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:07:42,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:07:42,468 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-01-10 00:07:42,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:07:42,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:07:42,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:07:42,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:07:42,712 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:07:42,713 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-01-10 00:07:43,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9904742/3da64bd4e25e47a096ed7f6767b9aa26/FLAG798365128 [2025-01-10 00:07:44,301 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:07:44,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-1.i [2025-01-10 00:07:44,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9904742/3da64bd4e25e47a096ed7f6767b9aa26/FLAG798365128 [2025-01-10 00:07:44,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f9904742/3da64bd4e25e47a096ed7f6767b9aa26 [2025-01-10 00:07:44,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:07:44,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:07:44,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:44,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:07:44,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:07:44,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:44" (1/1) ... [2025-01-10 00:07:44,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39350d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:44, skipping insertion in model container [2025-01-10 00:07:44,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:44" (1/1) ... [2025-01-10 00:07:44,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:07:45,399 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,405 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,409 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,412 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,415 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,416 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,418 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,419 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,419 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,420 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,422 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,425 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,437 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,440 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,449 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,450 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,451 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,458 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,463 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,478 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:45,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:45,518 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:07:45,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:45,675 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:07:45,681 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:07:45,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45 WrapperNode [2025-01-10 00:07:45,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:45,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:45,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:07:45,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:07:45,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,795 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 827 [2025-01-10 00:07:45,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:45,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:07:45,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:07:45,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:07:45,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,821 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:07:45,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:07:45,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:07:45,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:07:45,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:07:45,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (1/1) ... [2025-01-10 00:07:45,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:45,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:45,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:07:45,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:07:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:07:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 00:07:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:07:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:07:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:07:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:07:45,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:07:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:07:46,171 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:07:46,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:07:47,741 INFO L? ?]: Removed 370 outVars from TransFormulas that were not future-live. [2025-01-10 00:07:47,741 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:07:47,753 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:07:47,753 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-10 00:07:47,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:47 BoogieIcfgContainer [2025-01-10 00:07:47,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:07:47,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:07:47,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:07:47,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:07:47,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:07:44" (1/3) ... [2025-01-10 00:07:47,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a5b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:47, skipping insertion in model container [2025-01-10 00:07:47,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:45" (2/3) ... [2025-01-10 00:07:47,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0a5b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:47, skipping insertion in model container [2025-01-10 00:07:47,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:47" (3/3) ... [2025-01-10 00:07:47,761 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-1.i [2025-01-10 00:07:47,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:07:47,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-1.i that has 4 procedures, 309 locations, 1 initial locations, 13 loop locations, and 125 error locations. [2025-01-10 00:07:47,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:07:47,815 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;@c2307c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:07:47,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-01-10 00:07:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 173 states have (on average 1.9421965317919074) internal successors, (336), 298 states have internal predecessors, (336), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 00:07:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:47,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:47,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:47,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:47,833 INFO L85 PathProgramCache]: Analyzing trace with hash 319813, now seen corresponding path program 1 times [2025-01-10 00:07:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027017499] [2025-01-10 00:07:47,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:48,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:48,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:48,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027017499] [2025-01-10 00:07:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027017499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:48,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087794601] [2025-01-10 00:07:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:48,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:48,591 INFO L87 Difference]: Start difference. First operand has 309 states, 173 states have (on average 1.9421965317919074) internal successors, (336), 298 states have internal predecessors, (336), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:49,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:49,906 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2025-01-10 00:07:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:07:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:49,915 INFO L225 Difference]: With dead ends: 204 [2025-01-10 00:07:49,916 INFO L226 Difference]: Without dead ends: 202 [2025-01-10 00:07:49,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:49,921 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 102 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:49,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 180 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:07:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-10 00:07:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2025-01-10 00:07:49,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2025-01-10 00:07:49,970 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 3 [2025-01-10 00:07:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:49,970 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2025-01-10 00:07:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2025-01-10 00:07:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:49,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:49,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:49,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:07:49,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:49,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 319814, now seen corresponding path program 1 times [2025-01-10 00:07:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:49,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857753390] [2025-01-10 00:07:49,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:50,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:50,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:50,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:50,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857753390] [2025-01-10 00:07:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857753390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:50,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359608902] [2025-01-10 00:07:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:50,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:50,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:50,499 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:51,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:51,819 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2025-01-10 00:07:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:07:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:51,821 INFO L225 Difference]: With dead ends: 146 [2025-01-10 00:07:51,821 INFO L226 Difference]: Without dead ends: 146 [2025-01-10 00:07:51,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:51,825 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:51,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 246 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 00:07:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-10 00:07:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-01-10 00:07:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 140 states have internal predecessors, (151), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2025-01-10 00:07:51,836 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 3 [2025-01-10 00:07:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:51,837 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2025-01-10 00:07:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2025-01-10 00:07:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:07:51,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:51,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:07:51,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:07:51,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 937880936, now seen corresponding path program 1 times [2025-01-10 00:07:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243727539] [2025-01-10 00:07:51,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:07:51,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:07:51,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:51,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243727539] [2025-01-10 00:07:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243727539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:52,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:52,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62625288] [2025-01-10 00:07:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:52,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:52,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:52,109 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:52,137 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2025-01-10 00:07:52,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:52,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:07:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:52,139 INFO L225 Difference]: With dead ends: 149 [2025-01-10 00:07:52,139 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 00:07:52,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:52,140 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:52,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 00:07:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2025-01-10 00:07:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 85 states have (on average 1.7882352941176471) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2025-01-10 00:07:52,153 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 6 [2025-01-10 00:07:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:52,154 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2025-01-10 00:07:52,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2025-01-10 00:07:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:07:52,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:52,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:07:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:07:52,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:52,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 937880745, now seen corresponding path program 1 times [2025-01-10 00:07:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114324033] [2025-01-10 00:07:52,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:07:52,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:07:52,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:52,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114324033] [2025-01-10 00:07:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114324033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918292498] [2025-01-10 00:07:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:07:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:07:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:52,640 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:53,274 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2025-01-10 00:07:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:07:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:07:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:53,276 INFO L225 Difference]: With dead ends: 149 [2025-01-10 00:07:53,276 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 00:07:53,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:53,277 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:53,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 246 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 00:07:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 00:07:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2025-01-10 00:07:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2025-01-10 00:07:53,282 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 6 [2025-01-10 00:07:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:53,282 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2025-01-10 00:07:53,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2025-01-10 00:07:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:07:53,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:53,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:53,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:07:53,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:53,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1643258157, now seen corresponding path program 1 times [2025-01-10 00:07:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403378903] [2025-01-10 00:07:53,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:53,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:53,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:53,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:53,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:53,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403378903] [2025-01-10 00:07:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403378903] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248490261] [2025-01-10 00:07:53,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:53,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:53,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:07:53,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:53,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:53,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:53,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:53,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:07:53,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:53,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248490261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:53,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:07:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663632302] [2025-01-10 00:07:53,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:07:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:53,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:07:53,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:53,997 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:54,025 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2025-01-10 00:07:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:54,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:07:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:54,033 INFO L225 Difference]: With dead ends: 156 [2025-01-10 00:07:54,033 INFO L226 Difference]: Without dead ends: 156 [2025-01-10 00:07:54,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:54,034 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:54,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 603 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-10 00:07:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-01-10 00:07:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 150 states have internal predecessors, (163), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2025-01-10 00:07:54,048 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 9 [2025-01-10 00:07:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2025-01-10 00:07:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2025-01-10 00:07:54,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:07:54,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:54,048 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:54,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:07:54,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:54,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1643257966, now seen corresponding path program 1 times [2025-01-10 00:07:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:54,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764572517] [2025-01-10 00:07:54,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:54,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:54,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764572517] [2025-01-10 00:07:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764572517] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93152341] [2025-01-10 00:07:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:54,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:54,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:54,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:54,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:07:55,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:55,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:55,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:55,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:07:55,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:55,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:55,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-10 00:07:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93152341] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:55,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:07:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376259015] [2025-01-10 00:07:55,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:55,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:07:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:55,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:07:55,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:07:55,326 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:56,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:58,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:07:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:59,033 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2025-01-10 00:07:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:07:59,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:07:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:59,035 INFO L225 Difference]: With dead ends: 155 [2025-01-10 00:07:59,035 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 00:07:59,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:07:59,035 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 135 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:59,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 649 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-10 00:07:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 00:07:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-10 00:07:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.702127659574468) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 00:07:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2025-01-10 00:07:59,046 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 9 [2025-01-10 00:07:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:59,047 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2025-01-10 00:07:59,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2025-01-10 00:07:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:07:59,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:59,047 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:59,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:07:59,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:59,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1756782888, now seen corresponding path program 2 times [2025-01-10 00:07:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006181185] [2025-01-10 00:07:59,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:59,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 00:07:59,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-01-10 00:07:59,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:07:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 00:07:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:59,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006181185] [2025-01-10 00:07:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006181185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:07:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099271561] [2025-01-10 00:07:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:59,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:59,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:59,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:59,720 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:59,896 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2025-01-10 00:07:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:59,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 00:07:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:59,897 INFO L225 Difference]: With dead ends: 219 [2025-01-10 00:07:59,897 INFO L226 Difference]: Without dead ends: 219 [2025-01-10 00:07:59,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:59,898 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 114 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:59,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 308 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-10 00:07:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 163. [2025-01-10 00:07:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 101 states have (on average 1.6732673267326732) internal successors, (169), 156 states have internal predecessors, (169), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:07:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2025-01-10 00:07:59,906 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 18 [2025-01-10 00:07:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:59,907 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2025-01-10 00:07:59,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2025-01-10 00:07:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 00:07:59,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:59,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:59,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:07:59,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:07:59,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1756782889, now seen corresponding path program 1 times [2025-01-10 00:07:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065156698] [2025-01-10 00:07:59,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:00,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:00,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:00,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:00,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065156698] [2025-01-10 00:08:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065156698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286685958] [2025-01-10 00:08:00,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:00,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:00,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:08:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:08:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:08:00,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:08:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:00,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:08:00,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:00,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:08:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286685958] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:00,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:08:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248602652] [2025-01-10 00:08:00,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:08:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:00,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:08:00,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:08:00,748 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:00,810 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2025-01-10 00:08:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:08:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 00:08:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:00,812 INFO L225 Difference]: With dead ends: 181 [2025-01-10 00:08:00,812 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 00:08:00,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:08:00,813 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:00,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 897 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 00:08:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-10 00:08:00,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 119 states have (on average 1.5714285714285714) internal successors, (187), 174 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 195 transitions. [2025-01-10 00:08:00,822 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 195 transitions. Word has length 18 [2025-01-10 00:08:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:00,822 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 195 transitions. [2025-01-10 00:08:00,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 195 transitions. [2025-01-10 00:08:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:08:00,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:00,823 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:00,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:08:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:01,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:01,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1194017481, now seen corresponding path program 2 times [2025-01-10 00:08:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722310617] [2025-01-10 00:08:01,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:01,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:08:01,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:08:01,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:08:01,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:01,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722310617] [2025-01-10 00:08:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722310617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:01,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26742839] [2025-01-10 00:08:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:01,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:08:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:01,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:08:01,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:08:01,534 INFO L87 Difference]: Start difference. First operand 181 states and 195 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:02,288 INFO L93 Difference]: Finished difference Result 281 states and 302 transitions. [2025-01-10 00:08:02,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:02,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-10 00:08:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:02,290 INFO L225 Difference]: With dead ends: 281 [2025-01-10 00:08:02,290 INFO L226 Difference]: Without dead ends: 281 [2025-01-10 00:08:02,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:02,291 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 277 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:02,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 245 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:08:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-10 00:08:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 180. [2025-01-10 00:08:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.5630252100840336) internal successors, (186), 173 states have internal predecessors, (186), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2025-01-10 00:08:02,300 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 36 [2025-01-10 00:08:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:02,301 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2025-01-10 00:08:02,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:08:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2025-01-10 00:08:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:08:02,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:02,302 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:02,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:08:02,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1702932054, now seen corresponding path program 1 times [2025-01-10 00:08:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735233023] [2025-01-10 00:08:02,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:02,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:08:02,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:08:02,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:02,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735233023] [2025-01-10 00:08:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735233023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:02,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:02,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468622622] [2025-01-10 00:08:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:02,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:02,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:02,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:02,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:02,845 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:03,763 INFO L93 Difference]: Finished difference Result 225 states and 243 transitions. [2025-01-10 00:08:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:08:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:03,765 INFO L225 Difference]: With dead ends: 225 [2025-01-10 00:08:03,765 INFO L226 Difference]: Without dead ends: 225 [2025-01-10 00:08:03,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:03,765 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:03,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 00:08:03,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-10 00:08:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2025-01-10 00:08:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 168 states have internal predecessors, (181), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2025-01-10 00:08:03,774 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 44 [2025-01-10 00:08:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:03,775 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2025-01-10 00:08:03,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2025-01-10 00:08:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:08:03,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:03,776 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:03,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:08:03,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:03,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:03,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1702932053, now seen corresponding path program 1 times [2025-01-10 00:08:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441553203] [2025-01-10 00:08:03,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:03,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:03,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:08:04,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:08:04,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:04,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:04,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:04,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441553203] [2025-01-10 00:08:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441553203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:08:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425949344] [2025-01-10 00:08:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:08:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:08:04,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:04,745 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:04,888 INFO L93 Difference]: Finished difference Result 227 states and 252 transitions. [2025-01-10 00:08:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:08:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:04,890 INFO L225 Difference]: With dead ends: 227 [2025-01-10 00:08:04,890 INFO L226 Difference]: Without dead ends: 227 [2025-01-10 00:08:04,890 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-01-10 00:08:04,891 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 199 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:04,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 480 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-10 00:08:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2025-01-10 00:08:04,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 167 states have internal predecessors, (180), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2025-01-10 00:08:04,896 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 44 [2025-01-10 00:08:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:04,896 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2025-01-10 00:08:04,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2025-01-10 00:08:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:08:04,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:04,896 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:08:04,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 105165752, now seen corresponding path program 1 times [2025-01-10 00:08:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500461219] [2025-01-10 00:08:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:05,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:08:05,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:08:05,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:05,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:05,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:05,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500461219] [2025-01-10 00:08:05,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500461219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:05,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:08:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574501984] [2025-01-10 00:08:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:08:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:05,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:08:05,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:05,409 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:07,251 INFO L93 Difference]: Finished difference Result 242 states and 263 transitions. [2025-01-10 00:08:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:08:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:08:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:07,253 INFO L225 Difference]: With dead ends: 242 [2025-01-10 00:08:07,253 INFO L226 Difference]: Without dead ends: 242 [2025-01-10 00:08:07,253 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-01-10 00:08:07,254 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 195 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:07,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 307 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 00:08:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-10 00:08:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 187. [2025-01-10 00:08:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 133 states have (on average 1.5112781954887218) internal successors, (201), 180 states have internal predecessors, (201), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2025-01-10 00:08:07,259 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 47 [2025-01-10 00:08:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:07,259 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2025-01-10 00:08:07,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2025-01-10 00:08:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:08:07,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:07,260 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:07,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:08:07,260 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash 105166839, now seen corresponding path program 1 times [2025-01-10 00:08:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835490764] [2025-01-10 00:08:07,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:07,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:08:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:08:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:07,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:07,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835490764] [2025-01-10 00:08:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835490764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:07,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:07,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964675155] [2025-01-10 00:08:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:07,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:08:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:07,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:08:07,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:08:07,592 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:09,184 INFO L93 Difference]: Finished difference Result 232 states and 258 transitions. [2025-01-10 00:08:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:08:09,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:08:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:09,187 INFO L225 Difference]: With dead ends: 232 [2025-01-10 00:08:09,187 INFO L226 Difference]: Without dead ends: 232 [2025-01-10 00:08:09,187 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-01-10 00:08:09,187 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 146 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:09,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 221 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-10 00:08:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-10 00:08:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 184. [2025-01-10 00:08:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.481203007518797) internal successors, (197), 177 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2025-01-10 00:08:09,198 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 47 [2025-01-10 00:08:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2025-01-10 00:08:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2025-01-10 00:08:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:08:09,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:09,198 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:09,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:08:09,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash 105166840, now seen corresponding path program 1 times [2025-01-10 00:08:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464543001] [2025-01-10 00:08:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:09,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:08:09,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:08:09,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:09,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464543001] [2025-01-10 00:08:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464543001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:08:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182331708] [2025-01-10 00:08:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:08:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:09,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:08:09,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:08:09,600 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:09,670 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2025-01-10 00:08:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:08:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:09,672 INFO L225 Difference]: With dead ends: 189 [2025-01-10 00:08:09,672 INFO L226 Difference]: Without dead ends: 189 [2025-01-10 00:08:09,672 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-01-10 00:08:09,673 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 116 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:09,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 536 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:08:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-10 00:08:09,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2025-01-10 00:08:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.4736842105263157) internal successors, (196), 177 states have internal predecessors, (196), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2025-01-10 00:08:09,686 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 47 [2025-01-10 00:08:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:09,686 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2025-01-10 00:08:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2025-01-10 00:08:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:08:09,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:09,687 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:09,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:08:09,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:09,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1962023220, now seen corresponding path program 1 times [2025-01-10 00:08:09,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043436790] [2025-01-10 00:08:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:09,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:08:09,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:08:09,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:09,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:10,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:10,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043436790] [2025-01-10 00:08:10,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043436790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:10,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:10,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:08:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023188189] [2025-01-10 00:08:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:10,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:10,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:10,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:10,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:10,133 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:10,859 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2025-01-10 00:08:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:10,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 00:08:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:10,860 INFO L225 Difference]: With dead ends: 221 [2025-01-10 00:08:10,860 INFO L226 Difference]: Without dead ends: 221 [2025-01-10 00:08:10,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:10,861 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 72 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:10,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 178 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 00:08:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-10 00:08:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 188. [2025-01-10 00:08:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 138 states have (on average 1.4710144927536233) internal successors, (203), 181 states have internal predecessors, (203), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2025-01-10 00:08:10,866 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 50 [2025-01-10 00:08:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2025-01-10 00:08:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2025-01-10 00:08:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:08:10,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:10,867 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:10,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:08:10,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1962023221, now seen corresponding path program 1 times [2025-01-10 00:08:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150924176] [2025-01-10 00:08:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:10,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:08:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:08:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150924176] [2025-01-10 00:08:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150924176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:11,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:11,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:08:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325894960] [2025-01-10 00:08:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:11,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:11,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:11,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:11,714 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:13,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:15,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:16,378 INFO L93 Difference]: Finished difference Result 267 states and 297 transitions. [2025-01-10 00:08:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:08:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 00:08:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:16,380 INFO L225 Difference]: With dead ends: 267 [2025-01-10 00:08:16,380 INFO L226 Difference]: Without dead ends: 267 [2025-01-10 00:08:16,380 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-01-10 00:08:16,381 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 203 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:16,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 419 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-10 00:08:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-10 00:08:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 194. [2025-01-10 00:08:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 187 states have internal predecessors, (212), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2025-01-10 00:08:16,387 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 50 [2025-01-10 00:08:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:16,387 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2025-01-10 00:08:16,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2025-01-10 00:08:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:08:16,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:16,388 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:16,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:08:16,388 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:16,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 424116670, now seen corresponding path program 1 times [2025-01-10 00:08:16,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:16,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728909563] [2025-01-10 00:08:16,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:16,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:08:16,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:08:16,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:16,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:16,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728909563] [2025-01-10 00:08:16,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728909563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:16,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:16,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:08:16,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13724044] [2025-01-10 00:08:16,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:16,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:16,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:16,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:16,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:16,951 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:19,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:19,908 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2025-01-10 00:08:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:19,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:08:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:19,909 INFO L225 Difference]: With dead ends: 193 [2025-01-10 00:08:19,910 INFO L226 Difference]: Without dead ends: 193 [2025-01-10 00:08:19,910 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-01-10 00:08:19,910 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 89 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:19,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 439 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-10 00:08:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-10 00:08:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-10 00:08:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 144 states have (on average 1.4583333333333333) internal successors, (210), 186 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2025-01-10 00:08:19,914 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 53 [2025-01-10 00:08:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:19,915 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2025-01-10 00:08:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2025-01-10 00:08:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:08:19,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:19,916 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:08:19,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:19,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 424116671, now seen corresponding path program 1 times [2025-01-10 00:08:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740574751] [2025-01-10 00:08:19,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:19,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:08:20,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:08:20,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740574751] [2025-01-10 00:08:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740574751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:20,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:20,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:08:20,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471579231] [2025-01-10 00:08:20,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:20,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:20,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:20,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:20,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:20,824 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:23,479 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2025-01-10 00:08:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:08:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:23,480 INFO L225 Difference]: With dead ends: 192 [2025-01-10 00:08:23,480 INFO L226 Difference]: Without dead ends: 192 [2025-01-10 00:08:23,480 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-01-10 00:08:23,481 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 84 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:23,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 464 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-10 00:08:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-10 00:08:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-10 00:08:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 144 states have (on average 1.4444444444444444) internal successors, (208), 185 states have internal predecessors, (208), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2025-01-10 00:08:23,486 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 53 [2025-01-10 00:08:23,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:23,486 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2025-01-10 00:08:23,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2025-01-10 00:08:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 00:08:23,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:23,487 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:23,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:08:23,487 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:23,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1118192270, now seen corresponding path program 1 times [2025-01-10 00:08:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767818948] [2025-01-10 00:08:23,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:23,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:23,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 00:08:23,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 00:08:23,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:23,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767818948] [2025-01-10 00:08:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767818948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:08:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455003549] [2025-01-10 00:08:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:08:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:08:23,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:23,686 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:23,698 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2025-01-10 00:08:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:08:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-01-10 00:08:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:23,700 INFO L225 Difference]: With dead ends: 204 [2025-01-10 00:08:23,700 INFO L226 Difference]: Without dead ends: 204 [2025-01-10 00:08:23,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:08:23,701 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:23,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 271 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-10 00:08:23,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 194. [2025-01-10 00:08:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 146 states have (on average 1.4383561643835616) internal successors, (210), 187 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2025-01-10 00:08:23,707 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 57 [2025-01-10 00:08:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:23,707 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2025-01-10 00:08:23,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2025-01-10 00:08:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:08:23,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:23,708 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:08:23,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:23,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:23,709 INFO L85 PathProgramCache]: Analyzing trace with hash 303947258, now seen corresponding path program 1 times [2025-01-10 00:08:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:23,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415841247] [2025-01-10 00:08:23,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:23,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:08:23,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:08:23,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:23,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415841247] [2025-01-10 00:08:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415841247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:08:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071814655] [2025-01-10 00:08:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:24,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:08:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:24,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:08:24,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:08:24,461 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:28,157 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2025-01-10 00:08:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:08:28,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:08:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:28,159 INFO L225 Difference]: With dead ends: 240 [2025-01-10 00:08:28,159 INFO L226 Difference]: Without dead ends: 240 [2025-01-10 00:08:28,160 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-01-10 00:08:28,160 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 158 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:28,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 517 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-10 00:08:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-10 00:08:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 200. [2025-01-10 00:08:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 193 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 227 transitions. [2025-01-10 00:08:28,173 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 227 transitions. Word has length 58 [2025-01-10 00:08:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:28,173 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 227 transitions. [2025-01-10 00:08:28,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 227 transitions. [2025-01-10 00:08:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:08:28,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:28,173 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:28,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:08:28,174 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 303947259, now seen corresponding path program 1 times [2025-01-10 00:08:28,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:28,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333338721] [2025-01-10 00:08:28,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:28,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:08:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:08:28,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:28,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333338721] [2025-01-10 00:08:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333338721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:08:29,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:08:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:08:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517298312] [2025-01-10 00:08:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:08:29,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:08:29,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:29,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:08:29,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:08:29,351 INFO L87 Difference]: Start difference. First operand 200 states and 227 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:32,125 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2025-01-10 00:08:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:08:32,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:08:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:32,127 INFO L225 Difference]: With dead ends: 239 [2025-01-10 00:08:32,127 INFO L226 Difference]: Without dead ends: 239 [2025-01-10 00:08:32,127 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-01-10 00:08:32,128 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 212 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:32,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 619 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 00:08:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-10 00:08:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 200. [2025-01-10 00:08:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 193 states have internal predecessors, (217), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2025-01-10 00:08:32,132 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 58 [2025-01-10 00:08:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2025-01-10 00:08:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2025-01-10 00:08:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 00:08:32,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:32,133 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:32,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:08:32,133 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:32,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash -197028546, now seen corresponding path program 1 times [2025-01-10 00:08:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312125769] [2025-01-10 00:08:32,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:08:32,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:08:32,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312125769] [2025-01-10 00:08:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312125769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672456697] [2025-01-10 00:08:32,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:32,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:32,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:32,342 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-01-10 00:08:32,344 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-01-10 00:08:32,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:08:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:08:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:32,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:08:32,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:32,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672456697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:32,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:32,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:08:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223462064] [2025-01-10 00:08:32,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:32,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:08:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:32,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:08:32,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:32,892 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:32,922 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2025-01-10 00:08:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:08:32,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-01-10 00:08:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:32,925 INFO L225 Difference]: With dead ends: 229 [2025-01-10 00:08:32,925 INFO L226 Difference]: Without dead ends: 229 [2025-01-10 00:08:32,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:08:32,927 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 17 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:32,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 673 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:08:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-10 00:08:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 224. [2025-01-10 00:08:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 217 states have internal predecessors, (251), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 259 transitions. [2025-01-10 00:08:32,940 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 259 transitions. Word has length 62 [2025-01-10 00:08:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:32,940 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 259 transitions. [2025-01-10 00:08:32,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 259 transitions. [2025-01-10 00:08:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:08:32,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:32,941 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:32,953 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-01-10 00:08:33,148 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,SelfDestructingSolverStorable21 [2025-01-10 00:08:33,148 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:33,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1813192374, now seen corresponding path program 1 times [2025-01-10 00:08:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490088159] [2025-01-10 00:08:33,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:08:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:08:33,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:33,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490088159] [2025-01-10 00:08:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490088159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:33,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938846135] [2025-01-10 00:08:33,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:33,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:33,924 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-01-10 00:08:33,925 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-01-10 00:08:34,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:08:34,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:08:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:34,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 00:08:34,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:34,490 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-01-10 00:08:34,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:08:34,521 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-01-10 00:08:34,548 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-01-10 00:08:34,597 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-01-10 00:08:34,656 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:08:34,656 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-01-10 00:08:34,729 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:08:34,729 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-01-10 00:08:34,749 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-01-10 00:08:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 00:08:34,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:34,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4818 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_4818) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-01-10 00:08:34,859 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-01-10 00:08:34,859 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-01-10 00:08:35,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4817 (Array Int Int)) (v_ArrVal_4818 (Array Int Int)) (v_ArrVal_4816 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4816)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_4817))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_4818)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2025-01-10 00:08:35,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:08:35,103 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-01-10 00:08:35,122 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 2145 treesize of output 1537 [2025-01-10 00:08:35,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2025-01-10 00:08:35,162 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 126 treesize of output 108 [2025-01-10 00:08:35,166 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 108 treesize of output 66 [2025-01-10 00:08:35,347 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:08:35,348 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-01-10 00:08:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-01-10 00:08:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938846135] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:35,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2025-01-10 00:08:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142544972] [2025-01-10 00:08:35,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 00:08:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 00:08:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=239, Unknown=13, NotChecked=66, Total=380 [2025-01-10 00:08:35,366 INFO L87 Difference]: Start difference. First operand 224 states and 259 transitions. Second operand has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:37,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 00:08:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:42,780 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2025-01-10 00:08:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:08:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 00:08:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:42,783 INFO L225 Difference]: With dead ends: 262 [2025-01-10 00:08:42,783 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 00:08:42,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=386, Unknown=13, NotChecked=86, Total=600 [2025-01-10 00:08:42,784 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 275 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:42,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 976 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 654 Invalid, 0 Unknown, 341 Unchecked, 7.3s Time] [2025-01-10 00:08:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 00:08:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2025-01-10 00:08:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 216 states have internal predecessors, (245), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2025-01-10 00:08:42,788 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 63 [2025-01-10 00:08:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:42,788 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2025-01-10 00:08:42,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2025-01-10 00:08:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:08:42,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:42,789 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:08:42,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:08:42,989 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,SelfDestructingSolverStorable22 [2025-01-10 00:08:42,990 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:42,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1813192373, now seen corresponding path program 1 times [2025-01-10 00:08:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:42,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270041109] [2025-01-10 00:08:42,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:43,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:08:43,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:08:43,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:43,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270041109] [2025-01-10 00:08:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270041109] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128337580] [2025-01-10 00:08:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:08:44,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:44,177 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-01-10 00:08:44,179 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-01-10 00:08:44,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:08:44,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:08:44,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:08:44,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:44,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 00:08:44,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:08:44,689 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-01-10 00:08:44,702 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-01-10 00:08:44,710 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:08:44,711 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-01-10 00:08:44,746 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-01-10 00:08:44,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:08:44,801 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-01-10 00:08:44,804 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-01-10 00:08:44,872 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:08:44,872 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-01-10 00:08:44,880 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-01-10 00:08:44,984 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:08:44,984 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-01-10 00:08:44,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 26 [2025-01-10 00:08:45,078 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-01-10 00:08:45,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-01-10 00:08:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:45,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:08:45,815 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_5264 (Array Int Int)) (v_ArrVal_5263 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5263))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0) (forall ((v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5265 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5264))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_5266) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5265) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_5264 (Array Int Int)) (v_ArrVal_5263 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5263))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5266 (Array Int Int))) (< .cse4 (+ (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5264) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5266) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (< .cse4 0))))))) is different from false [2025-01-10 00:08:46,110 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_5264 (Array Int Int)) (v_ArrVal_5263 (Array Int Int)) (v_ArrVal_5262 (Array Int Int)) (v_ArrVal_5261 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5261))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5262) .cse5 v_ArrVal_5263))) (or (forall ((v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5265 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_5264))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_5266) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5265) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 0)))))) (forall ((v_ArrVal_5264 (Array Int Int)) (v_ArrVal_5263 (Array Int Int)) (v_ArrVal_5262 (Array Int Int)) (v_ArrVal_5261 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5261))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5262) .cse9 v_ArrVal_5263))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_5266 (Array Int Int))) (< .cse6 (+ (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_5264) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5266) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (< .cse6 0))))))))) is different from false [2025-01-10 00:08:46,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:08:46,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 424 [2025-01-10 00:08:46,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:08:46,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 411 treesize of output 268 [2025-01-10 00:08:46,196 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 12024 treesize of output 9920 [2025-01-10 00:08:46,284 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 37195 treesize of output 34499 [2025-01-10 00:08:46,323 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 607 treesize of output 511 [2025-01-10 00:08:46,331 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 511 treesize of output 487 [2025-01-10 00:08:46,338 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 487 treesize of output 451 [2025-01-10 00:08:46,345 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 451 treesize of output 403 [2025-01-10 00:08:46,352 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 403 treesize of output 391 [2025-01-10 00:08:46,360 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 391 treesize of output 379 [2025-01-10 00:08:46,367 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 379 treesize of output 355 [2025-01-10 00:08:46,374 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 355 treesize of output 343 [2025-01-10 00:08:46,380 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 343 treesize of output 325 [2025-01-10 00:08:46,388 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 325 treesize of output 313 [2025-01-10 00:08:46,396 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 313 treesize of output 307 [2025-01-10 00:08:46,646 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:08:46,646 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-01-10 00:08:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:46,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128337580] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:08:46,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:08:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2025-01-10 00:08:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677814198] [2025-01-10 00:08:46,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:08:46,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-10 00:08:46,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:08:46,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-10 00:08:46,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=8, NotChecked=118, Total=1056 [2025-01-10 00:08:46,655 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:52,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:08:54,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 00:08:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:08:56,035 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2025-01-10 00:08:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:08:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 00:08:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:08:56,036 INFO L225 Difference]: With dead ends: 262 [2025-01-10 00:08:56,037 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 00:08:56,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=8, NotChecked=158, Total=1806 [2025-01-10 00:08:56,038 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 259 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 13 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:08:56,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1179 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 990 Invalid, 26 Unknown, 372 Unchecked, 9.0s Time] [2025-01-10 00:08:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 00:08:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 223. [2025-01-10 00:08:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 216 states have internal predecessors, (241), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 00:08:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-01-10 00:08:56,044 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 63 [2025-01-10 00:08:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:08:56,044 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-01-10 00:08:56,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 33 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:08:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-01-10 00:08:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 00:08:56,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:08:56,046 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, 1] [2025-01-10 00:08:56,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 00:08:56,250 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,SelfDestructingSolverStorable23 [2025-01-10 00:08:56,250 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-01-10 00:08:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:08:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2094362805, now seen corresponding path program 2 times [2025-01-10 00:08:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:08:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929531714] [2025-01-10 00:08:56,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:08:56,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 00:08:56,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 00:08:56,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:08:56,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:08:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:08:58,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:08:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929531714] [2025-01-10 00:08:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929531714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:08:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402498834] [2025-01-10 00:08:58,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:08:58,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:08:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:08:58,842 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-01-10 00:08:58,845 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-01-10 00:08:59,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 00:09:05,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 00:09:05,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:09:05,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:09:05,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-10 00:09:05,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:09:05,714 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 00:09:05,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-01-10 00:09:05,728 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-01-10 00:09:05,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:09:05,736 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-01-10 00:09:05,768 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-01-10 00:09:05,770 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-01-10 00:09:05,816 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-01-10 00:09:05,822 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-01-10 00:09:05,886 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:05,886 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-01-10 00:09:05,892 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-01-10 00:09:05,986 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:05,987 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-01-10 00:09:05,993 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-01-10 00:09:06,089 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:06,090 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-01-10 00:09:06,097 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-01-10 00:09:06,180 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:09:06,180 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-01-10 00:09:06,183 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-01-10 00:09:06,231 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-01-10 00:09:06,234 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-01-10 00:09:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:09:06,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:09:06,462 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_5743 (Array Int Int)) (v_ArrVal_5742 (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_5742) |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_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_5742 (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_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-01-10 00:09:06,484 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_5742 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:09:06,506 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_5742 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))) (forall ((v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:09:06,543 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5741) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5740))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5741) .cse1 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-01-10 00:09:06,848 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5739))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5740))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5738) .cse0 v_ArrVal_5741) .cse1 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem170#1.base| v_ArrVal_5739))) (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~mem170#1.base| v_ArrVal_5738) .cse5 v_ArrVal_5741) (select (select (store .cse6 .cse5 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5742))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))))) is different from false [2025-01-10 00:09:06,883 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5739))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_5740))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5738) .cse1 v_ArrVal_5741) .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5739))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5738) .cse6 v_ArrVal_5741) (select (select (store .cse7 .cse6 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5742))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3)))))) is different from false [2025-01-10 00:09:06,906 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5739))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5738) .cse1 v_ArrVal_5741) (select (select (store .cse2 .cse1 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5742))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5739))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5740))) (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_5738) .cse4 v_ArrVal_5741) .cse5 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-01-10 00:09:06,940 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5736))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_5739))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_5740))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5737) .cse0 v_ArrVal_5738) .cse1 v_ArrVal_5741) .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem169#1.base| v_ArrVal_5736))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_5739))) (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_#t~mem169#1.base| v_ArrVal_5737) .cse7 v_ArrVal_5738) .cse8 v_ArrVal_5741) (select (select (store .cse9 .cse8 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5742))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))))) is different from false [2025-01-10 00:09:06,961 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|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5736))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_5739))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_5740))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 4 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5737) .cse1 v_ArrVal_5738) .cse2 v_ArrVal_5741) .cse3 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5736))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_5739))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5737) .cse8 v_ArrVal_5738) .cse9 v_ArrVal_5741) (select (select (store .cse10 .cse9 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5742))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2025-01-10 00:09:07,026 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_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5743 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5734 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5735 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5735))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_5736))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_5739))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_5740))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5734) .cse0 v_ArrVal_5737) .cse1 v_ArrVal_5738) .cse2 v_ArrVal_5741) .cse3 v_ArrVal_5742) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_5743) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5742 (Array Int Int)) (v_ArrVal_5734 (Array Int Int)) (v_ArrVal_5736 (Array Int Int)) (v_ArrVal_5735 (Array Int Int)) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5737 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5735))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_5736))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_5739))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5734) .cse9 v_ArrVal_5737) .cse10 v_ArrVal_5738) .cse11 v_ArrVal_5741) (select (select (store .cse12 .cse11 v_ArrVal_5740) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5742))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3))))) is different from false [2025-01-10 00:09:07,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:07,084 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 833 treesize of output 834 [2025-01-10 00:09:07,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:09:07,089 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 821 treesize of output 462 [2025-01-10 00:09:07,850 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 31254227478 treesize of output 27995099246