./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/mkfifo-incomplete-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 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:04:11,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:04:11,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:04:11,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:04:11,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:04:11,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:04:11,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:04:11,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:04:11,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:04:11,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:04:11,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:04:11,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:04:11,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:04:11,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:04:11,459 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:04:11,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:04:11,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:04:11,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:04:11,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:11,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:04:11,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:04:11,465 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 -> 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d [2025-02-06 12:04:11,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:04:11,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:04:11,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:04:11,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:04:11,814 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:04:11,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-02-06 12:04:13,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f649c37d/2c2533f5fd1f45b6a28bcbb7bb8e4efd/FLAGbae183251 [2025-02-06 12:04:13,506 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:04:13,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-02-06 12:04:13,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f649c37d/2c2533f5fd1f45b6a28bcbb7bb8e4efd/FLAGbae183251 [2025-02-06 12:04:13,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f649c37d/2c2533f5fd1f45b6a28bcbb7bb8e4efd [2025-02-06 12:04:13,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:04:13,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:04:13,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:13,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:04:13,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:04:13,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:13" (1/1) ... [2025-02-06 12:04:13,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abc21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:13, skipping insertion in model container [2025-02-06 12:04:13,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:13" (1/1) ... [2025-02-06 12:04:13,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:04:14,533 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,537 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,540 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,542 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,542 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,542 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,549 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,551 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,564 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,571 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,574 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,580 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,600 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:14,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:14,654 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:04:14,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:14,954 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:04:14,961 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:04:14,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14 WrapperNode [2025-02-06 12:04:14,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:14,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:14,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:04:14,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:04:14,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,141 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 776 [2025-02-06 12:04:15,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:15,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:04:15,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:04:15,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:04:15,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,198 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:04:15,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:04:15,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:04:15,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:04:15,291 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:04:15,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (1/1) ... [2025-02-06 12:04:15,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:15,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:15,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:04:15,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:04:15,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:04:15,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:04:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:04:15,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:04:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:04:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:04:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:04:15,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:04:15,641 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:04:15,643 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:04:16,700 INFO L? ?]: Removed 361 outVars from TransFormulas that were not future-live. [2025-02-06 12:04:16,700 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:04:16,738 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:04:16,739 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:04:16,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:16 BoogieIcfgContainer [2025-02-06 12:04:16,741 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:04:16,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:04:16,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:04:16,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:04:16,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:04:13" (1/3) ... [2025-02-06 12:04:16,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bea54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:16, skipping insertion in model container [2025-02-06 12:04:16,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:14" (2/3) ... [2025-02-06 12:04:16,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333bea54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:16, skipping insertion in model container [2025-02-06 12:04:16,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:16" (3/3) ... [2025-02-06 12:04:16,750 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2025-02-06 12:04:16,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:04:16,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-1.i that has 3 procedures, 311 locations, 1 initial locations, 12 loop locations, and 125 error locations. [2025-02-06 12:04:16,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:04:16,820 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;@6856d85e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:04:16,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-02-06 12:04:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 176 states have (on average 1.9147727272727273) internal successors, (337), 301 states have internal predecessors, (337), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 12:04:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:16,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:16,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:16,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:16,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 396174, now seen corresponding path program 1 times [2025-02-06 12:04:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371003461] [2025-02-06 12:04:16,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:17,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:17,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:17,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:17,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371003461] [2025-02-06 12:04:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371003461] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:17,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280224235] [2025-02-06 12:04:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:17,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:17,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:17,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:17,524 INFO L87 Difference]: Start difference. First operand has 311 states, 176 states have (on average 1.9147727272727273) internal successors, (337), 301 states have internal predecessors, (337), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 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-02-06 12:04:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:17,763 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2025-02-06 12:04:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:17,765 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-02-06 12:04:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:17,774 INFO L225 Difference]: With dead ends: 217 [2025-02-06 12:04:17,775 INFO L226 Difference]: Without dead ends: 215 [2025-02-06 12:04:17,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:17,780 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 117 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:17,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 171 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-06 12:04:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 147. [2025-02-06 12:04:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 85 states have (on average 1.8) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2025-02-06 12:04:17,826 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 3 [2025-02-06 12:04:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:17,827 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2025-02-06 12:04:17,827 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-02-06 12:04:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2025-02-06 12:04:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:17,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:17,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:17,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:04:17,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 396175, now seen corresponding path program 1 times [2025-02-06 12:04:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492202213] [2025-02-06 12:04:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:17,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:17,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:17,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492202213] [2025-02-06 12:04:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492202213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:18,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022322592] [2025-02-06 12:04:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:18,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:18,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:18,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:18,180 INFO L87 Difference]: Start difference. First operand 147 states and 159 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-02-06 12:04:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:18,325 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2025-02-06 12:04:18,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:18,326 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-02-06 12:04:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:18,327 INFO L225 Difference]: With dead ends: 146 [2025-02-06 12:04:18,327 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 12:04:18,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:18,328 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 10 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:18,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 245 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 12:04:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-02-06 12:04:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.7882352941176471) internal successors, (152), 141 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2025-02-06 12:04:18,339 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 3 [2025-02-06 12:04:18,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:18,339 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2025-02-06 12:04:18,340 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-02-06 12:04:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2025-02-06 12:04:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:18,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:18,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:18,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:04:18,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:18,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1082150787, now seen corresponding path program 1 times [2025-02-06 12:04:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910427440] [2025-02-06 12:04:18,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:18,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:18,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:18,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910427440] [2025-02-06 12:04:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910427440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:18,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741455554] [2025-02-06 12:04:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:18,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:18,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:18,555 INFO L87 Difference]: Start difference. First operand 146 states and 158 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-02-06 12:04:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:18,577 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2025-02-06 12:04:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:18,582 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-02-06 12:04:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:18,584 INFO L225 Difference]: With dead ends: 149 [2025-02-06 12:04:18,585 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 12:04:18,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:18,587 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 305 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-02-06 12:04:18,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 305 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 12:04:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2025-02-06 12:04:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 86 states have (on average 1.7790697674418605) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2025-02-06 12:04:18,603 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 6 [2025-02-06 12:04:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:18,603 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2025-02-06 12:04:18,604 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-02-06 12:04:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2025-02-06 12:04:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:18,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:18,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:18,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:04:18,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1082150626, now seen corresponding path program 1 times [2025-02-06 12:04:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233988661] [2025-02-06 12:04:18,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:18,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:18,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:18,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233988661] [2025-02-06 12:04:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233988661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:04:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585773478] [2025-02-06 12:04:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:04:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:18,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:04:18,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:18,934 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-02-06 12:04:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:19,136 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2025-02-06 12:04:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:04:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-02-06 12:04:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:19,138 INFO L225 Difference]: With dead ends: 148 [2025-02-06 12:04:19,138 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 12:04:19,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:19,139 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 148 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:19,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 339 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 12:04:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-02-06 12:04:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 87 states have (on average 1.7586206896551724) internal successors, (153), 142 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2025-02-06 12:04:19,156 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 6 [2025-02-06 12:04:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:19,157 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2025-02-06 12:04:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-02-06 12:04:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2025-02-06 12:04:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:19,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:19,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:04:19,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash -324478519, now seen corresponding path program 1 times [2025-02-06 12:04:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102153355] [2025-02-06 12:04:19,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:19,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:19,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:19,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:19,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102153355] [2025-02-06 12:04:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102153355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61626040] [2025-02-06 12:04:19,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:19,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:19,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:19,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:04:19,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:19,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:04:19,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:19,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61626040] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:19,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:04:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051116675] [2025-02-06 12:04:19,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:19,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:19,688 INFO L87 Difference]: Start difference. First operand 147 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-02-06 12:04:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:19,719 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2025-02-06 12:04:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:19,720 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-02-06 12:04:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:19,721 INFO L225 Difference]: With dead ends: 155 [2025-02-06 12:04:19,721 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 12:04:19,722 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-02-06 12:04:19,722 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:19,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 12:04:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-02-06 12:04:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 150 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2025-02-06 12:04:19,733 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 9 [2025-02-06 12:04:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:19,733 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2025-02-06 12:04:19,733 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-02-06 12:04:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2025-02-06 12:04:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:19,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:19,734 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:19,745 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-02-06 12:04:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:19,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -324478358, now seen corresponding path program 1 times [2025-02-06 12:04:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329073019] [2025-02-06 12:04:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:19,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:19,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:19,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:19,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329073019] [2025-02-06 12:04:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329073019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078244341] [2025-02-06 12:04:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:20,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:20,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:20,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:04:20,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:20,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:20,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:20,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:04:20,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:20,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:20,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:04:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:20,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078244341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:20,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:20,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:04:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414293160] [2025-02-06 12:04:20,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:20,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:04:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:20,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:04:20,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:04:20,858 INFO L87 Difference]: Start difference. First operand 155 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-02-06 12:04:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:21,122 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-02-06 12:04:21,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:04:21,124 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-02-06 12:04:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:21,125 INFO L225 Difference]: With dead ends: 154 [2025-02-06 12:04:21,125 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 12:04:21,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:04:21,126 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 282 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:21,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 435 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 12:04:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-02-06 12:04:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 149 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:04:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-02-06 12:04:21,139 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 9 [2025-02-06 12:04:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-02-06 12:04:21,144 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-02-06 12:04:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-02-06 12:04:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:04:21,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:21,145 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:21,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:04:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:21,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:21,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1379391107, now seen corresponding path program 2 times [2025-02-06 12:04:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:21,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141116507] [2025-02-06 12:04:21,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:21,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 12:04:21,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 12:04:21,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:21,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 12:04:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141116507] [2025-02-06 12:04:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141116507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:21,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:04:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508407907] [2025-02-06 12:04:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:21,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:21,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:21,748 INFO L87 Difference]: Start difference. First operand 154 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-02-06 12:04:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:21,942 INFO L93 Difference]: Finished difference Result 225 states and 244 transitions. [2025-02-06 12:04:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:21,943 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-02-06 12:04:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:21,944 INFO L225 Difference]: With dead ends: 225 [2025-02-06 12:04:21,945 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 12:04:21,945 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-02-06 12:04:21,945 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 239 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:21,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 292 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 12:04:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 173. [2025-02-06 12:04:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.6814159292035398) internal successors, (190), 166 states have internal predecessors, (190), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2025-02-06 12:04:21,960 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 18 [2025-02-06 12:04:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2025-02-06 12:04:21,960 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-02-06 12:04:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2025-02-06 12:04:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:04:21,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:21,960 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:04:21,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:21,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1379391106, now seen corresponding path program 1 times [2025-02-06 12:04:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207895701] [2025-02-06 12:04:21,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:04:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:04:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:22,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207895701] [2025-02-06 12:04:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207895701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:22,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985854650] [2025-02-06 12:04:22,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:22,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:22,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:04:22,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:04:22,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:04:22,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:22,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:04:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:22,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:22,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985854650] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:22,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:04:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577965371] [2025-02-06 12:04:22,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:22,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:04:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:22,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:04:22,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:04:22,596 INFO L87 Difference]: Start difference. First operand 173 states and 198 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-02-06 12:04:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:22,649 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2025-02-06 12:04:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:04:22,650 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-02-06 12:04:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:22,651 INFO L225 Difference]: With dead ends: 191 [2025-02-06 12:04:22,651 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 12:04:22,651 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-02-06 12:04:22,652 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:22,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 12:04:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-06 12:04:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 131 states have (on average 1.5877862595419847) internal successors, (208), 184 states have internal predecessors, (208), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2025-02-06 12:04:22,660 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 18 [2025-02-06 12:04:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2025-02-06 12:04:22,661 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-02-06 12:04:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2025-02-06 12:04:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:04:22,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:22,662 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:22,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:04:22,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:22,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:22,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1268019458, now seen corresponding path program 2 times [2025-02-06 12:04:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40999503] [2025-02-06 12:04:22,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:22,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:04:22,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:04:22,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40999503] [2025-02-06 12:04:23,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40999503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:23,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381955058] [2025-02-06 12:04:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:04:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:23,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:04:23,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:23,157 INFO L87 Difference]: Start difference. First operand 191 states and 216 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-02-06 12:04:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:23,420 INFO L93 Difference]: Finished difference Result 315 states and 337 transitions. [2025-02-06 12:04:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:23,420 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-02-06 12:04:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:23,422 INFO L225 Difference]: With dead ends: 315 [2025-02-06 12:04:23,422 INFO L226 Difference]: Without dead ends: 315 [2025-02-06 12:04:23,422 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-02-06 12:04:23,423 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 306 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:23,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 273 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-06 12:04:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 190. [2025-02-06 12:04:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.5801526717557253) internal successors, (207), 183 states have internal predecessors, (207), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2025-02-06 12:04:23,430 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 36 [2025-02-06 12:04:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2025-02-06 12:04:23,430 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-02-06 12:04:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2025-02-06 12:04:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:04:23,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:23,431 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:04:23,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:23,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash -810780429, now seen corresponding path program 1 times [2025-02-06 12:04:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:23,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123113922] [2025-02-06 12:04:23,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:23,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:23,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:04:23,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:04:23,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:23,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123113922] [2025-02-06 12:04:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123113922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:23,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:23,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485595524] [2025-02-06 12:04:23,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:23,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:23,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:23,740 INFO L87 Difference]: Start difference. First operand 190 states and 215 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-02-06 12:04:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:23,873 INFO L93 Difference]: Finished difference Result 237 states and 256 transitions. [2025-02-06 12:04:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:23,874 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-02-06 12:04:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:23,877 INFO L225 Difference]: With dead ends: 237 [2025-02-06 12:04:23,877 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 12:04:23,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:23,878 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:23,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 171 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 12:04:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 185. [2025-02-06 12:04:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 131 states have (on average 1.5419847328244274) internal successors, (202), 178 states have internal predecessors, (202), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2025-02-06 12:04:23,889 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 44 [2025-02-06 12:04:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:23,890 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2025-02-06 12:04:23,890 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-02-06 12:04:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2025-02-06 12:04:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:04:23,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:23,891 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:23,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:04:23,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:23,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -810780428, now seen corresponding path program 1 times [2025-02-06 12:04:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739968794] [2025-02-06 12:04:23,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:23,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:04:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:04:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739968794] [2025-02-06 12:04:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739968794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:24,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:24,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588856740] [2025-02-06 12:04:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:24,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:24,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:24,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:24,893 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:25,141 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2025-02-06 12:04:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:04:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:04:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:25,143 INFO L225 Difference]: With dead ends: 233 [2025-02-06 12:04:25,143 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 12:04:25,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:25,144 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 268 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:25,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 619 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 12:04:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2025-02-06 12:04:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 131 states have (on average 1.534351145038168) internal successors, (201), 177 states have internal predecessors, (201), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 209 transitions. [2025-02-06 12:04:25,158 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 209 transitions. Word has length 44 [2025-02-06 12:04:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 209 transitions. [2025-02-06 12:04:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 209 transitions. [2025-02-06 12:04:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:04:25,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:25,159 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-02-06 12:04:25,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:04:25,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:25,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 936628105, now seen corresponding path program 1 times [2025-02-06 12:04:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842673447] [2025-02-06 12:04:25,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:04:25,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:04:25,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:25,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:25,672 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842673447] [2025-02-06 12:04:25,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842673447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:04:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703637061] [2025-02-06 12:04:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:25,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:25,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:25,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:25,676 INFO L87 Difference]: Start difference. First operand 184 states and 209 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-02-06 12:04:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:25,958 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions. [2025-02-06 12:04:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:04:25,958 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-02-06 12:04:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:25,959 INFO L225 Difference]: With dead ends: 254 [2025-02-06 12:04:25,961 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 12:04:25,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:25,961 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 302 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:25,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 289 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:04:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 12:04:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 197. [2025-02-06 12:04:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 145 states have (on average 1.5310344827586206) internal successors, (222), 190 states have internal predecessors, (222), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 230 transitions. [2025-02-06 12:04:25,971 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 230 transitions. Word has length 47 [2025-02-06 12:04:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:25,971 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 230 transitions. [2025-02-06 12:04:25,973 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-02-06 12:04:25,973 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 230 transitions. [2025-02-06 12:04:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:04:25,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:25,975 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-02-06 12:04:25,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:04:25,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1314365138, now seen corresponding path program 1 times [2025-02-06 12:04:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616387701] [2025-02-06 12:04:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:26,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:04:26,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:04:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:26,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616387701] [2025-02-06 12:04:26,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616387701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:26,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:26,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:26,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103083265] [2025-02-06 12:04:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:26,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:26,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:26,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:26,299 INFO L87 Difference]: Start difference. First operand 197 states and 230 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-02-06 12:04:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:26,432 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2025-02-06 12:04:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:26,433 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-02-06 12:04:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:26,434 INFO L225 Difference]: With dead ends: 238 [2025-02-06 12:04:26,434 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 12:04:26,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:26,435 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:26,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 167 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 12:04:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 203. [2025-02-06 12:04:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.519736842105263) internal successors, (231), 196 states have internal predecessors, (231), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 239 transitions. [2025-02-06 12:04:26,443 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 239 transitions. Word has length 50 [2025-02-06 12:04:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 239 transitions. [2025-02-06 12:04:26,444 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-02-06 12:04:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 239 transitions. [2025-02-06 12:04:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:04:26,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:26,445 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-02-06 12:04:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:04:26,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:26,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1314365137, now seen corresponding path program 1 times [2025-02-06 12:04:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:26,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560448637] [2025-02-06 12:04:26,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:26,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:04:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:04:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560448637] [2025-02-06 12:04:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560448637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:04:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308977487] [2025-02-06 12:04:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:27,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:27,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:27,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:27,070 INFO L87 Difference]: Start difference. First operand 203 states and 239 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:27,470 INFO L93 Difference]: Finished difference Result 247 states and 271 transitions. [2025-02-06 12:04:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:27,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:04:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:27,472 INFO L225 Difference]: With dead ends: 247 [2025-02-06 12:04:27,472 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 12:04:27,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:27,472 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 201 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:27,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 298 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:04:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 12:04:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 203. [2025-02-06 12:04:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 152 states have (on average 1.513157894736842) internal successors, (230), 196 states have internal predecessors, (230), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2025-02-06 12:04:27,484 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 50 [2025-02-06 12:04:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:27,484 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2025-02-06 12:04:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2025-02-06 12:04:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:27,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:27,488 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] [2025-02-06 12:04:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:04:27,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1054265151, now seen corresponding path program 1 times [2025-02-06 12:04:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199505031] [2025-02-06 12:04:27,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:27,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:27,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:27,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:27,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-06 12:04:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199505031] [2025-02-06 12:04:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199505031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:27,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306980813] [2025-02-06 12:04:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:04:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:27,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:04:27,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:27,754 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:04:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:27,949 INFO L93 Difference]: Finished difference Result 242 states and 268 transitions. [2025-02-06 12:04:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:04:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2025-02-06 12:04:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:27,952 INFO L225 Difference]: With dead ends: 242 [2025-02-06 12:04:27,952 INFO L226 Difference]: Without dead ends: 242 [2025-02-06 12:04:27,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:27,954 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:27,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 207 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-06 12:04:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2025-02-06 12:04:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 154 states have (on average 1.4805194805194806) internal successors, (228), 195 states have internal predecessors, (228), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 236 transitions. [2025-02-06 12:04:27,966 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 236 transitions. Word has length 53 [2025-02-06 12:04:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:27,966 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 236 transitions. [2025-02-06 12:04:27,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:04:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 236 transitions. [2025-02-06 12:04:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:27,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:27,967 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] [2025-02-06 12:04:27,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:04:27,967 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:27,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1054265150, now seen corresponding path program 1 times [2025-02-06 12:04:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000526557] [2025-02-06 12:04:27,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:28,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:28,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:28,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:28,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 12:04:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000526557] [2025-02-06 12:04:28,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000526557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:28,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149356197] [2025-02-06 12:04:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:28,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:28,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:04:28,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:28,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:04:28,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 12:04:28,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:04:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149356197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:28,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:04:28,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-06 12:04:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490628166] [2025-02-06 12:04:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:28,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:28,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:28,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:28,716 INFO L87 Difference]: Start difference. First operand 202 states and 236 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:04:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:28,795 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2025-02-06 12:04:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:28,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2025-02-06 12:04:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:28,797 INFO L225 Difference]: With dead ends: 207 [2025-02-06 12:04:28,797 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 12:04:28,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:28,798 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 18 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:28,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 638 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 12:04:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2025-02-06 12:04:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 154 states have (on average 1.474025974025974) internal successors, (227), 195 states have internal predecessors, (227), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2025-02-06 12:04:28,809 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 53 [2025-02-06 12:04:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:28,809 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2025-02-06 12:04:28,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:04:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2025-02-06 12:04:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:28,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:28,810 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-02-06 12:04:28,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:04:29,011 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,SelfDestructingSolverStorable15 [2025-02-06 12:04:29,012 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:29,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash 965315233, now seen corresponding path program 1 times [2025-02-06 12:04:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:29,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495255788] [2025-02-06 12:04:29,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:29,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:29,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:29,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:29,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:29,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495255788] [2025-02-06 12:04:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495255788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176787393] [2025-02-06 12:04:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:29,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:29,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:29,510 INFO L87 Difference]: Start difference. First operand 202 states and 235 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-02-06 12:04:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:29,753 INFO L93 Difference]: Finished difference Result 201 states and 233 transitions. [2025-02-06 12:04:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:29,754 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-02-06 12:04:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:29,755 INFO L225 Difference]: With dead ends: 201 [2025-02-06 12:04:29,755 INFO L226 Difference]: Without dead ends: 201 [2025-02-06 12:04:29,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:29,756 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 94 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:29,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 448 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-06 12:04:29,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-06 12:04:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.4610389610389611) internal successors, (225), 194 states have internal predecessors, (225), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2025-02-06 12:04:29,761 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 53 [2025-02-06 12:04:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:29,762 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2025-02-06 12:04:29,762 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-02-06 12:04:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2025-02-06 12:04:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:29,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:29,762 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-02-06 12:04:29,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:04:29,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:29,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 965315234, now seen corresponding path program 1 times [2025-02-06 12:04:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:29,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509219168] [2025-02-06 12:04:29,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:29,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:29,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:30,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:30,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509219168] [2025-02-06 12:04:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509219168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:30,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564688053] [2025-02-06 12:04:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:30,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:30,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:30,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:30,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:30,506 INFO L87 Difference]: Start difference. First operand 201 states and 233 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-02-06 12:04:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:30,755 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2025-02-06 12:04:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:30,756 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-02-06 12:04:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:30,757 INFO L225 Difference]: With dead ends: 200 [2025-02-06 12:04:30,757 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 12:04:30,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:30,758 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 93 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:30,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 470 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 12:04:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-06 12:04:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 154 states have (on average 1.448051948051948) internal successors, (223), 193 states have internal predecessors, (223), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 231 transitions. [2025-02-06 12:04:30,764 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 231 transitions. Word has length 53 [2025-02-06 12:04:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:30,764 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 231 transitions. [2025-02-06 12:04:30,764 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-02-06 12:04:30,764 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 231 transitions. [2025-02-06 12:04:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 12:04:30,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:30,765 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-02-06 12:04:30,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:04:30,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash -283270763, now seen corresponding path program 1 times [2025-02-06 12:04:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581871455] [2025-02-06 12:04:30,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:30,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 12:04:30,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 12:04:30,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:30,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581871455] [2025-02-06 12:04:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581871455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:30,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72291333] [2025-02-06 12:04:30,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:30,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:30,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:30,930 INFO L87 Difference]: Start difference. First operand 200 states and 231 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-02-06 12:04:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:30,945 INFO L93 Difference]: Finished difference Result 212 states and 246 transitions. [2025-02-06 12:04:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:30,946 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-02-06 12:04:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:30,948 INFO L225 Difference]: With dead ends: 212 [2025-02-06 12:04:30,948 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 12:04:30,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:30,948 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-02-06 12:04:30,948 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-02-06 12:04:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 12:04:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2025-02-06 12:04:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 156 states have (on average 1.4423076923076923) internal successors, (225), 195 states have internal predecessors, (225), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 233 transitions. [2025-02-06 12:04:30,955 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 233 transitions. Word has length 57 [2025-02-06 12:04:30,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 233 transitions. [2025-02-06 12:04:30,955 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-02-06 12:04:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 233 transitions. [2025-02-06 12:04:30,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:04:30,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:30,956 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-02-06 12:04:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:04:30,956 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:30,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:30,956 INFO L85 PathProgramCache]: Analyzing trace with hash -191212444, now seen corresponding path program 1 times [2025-02-06 12:04:30,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:30,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413257661] [2025-02-06 12:04:30,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:31,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:04:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:04:31,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:31,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:31,719 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413257661] [2025-02-06 12:04:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413257661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:04:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774639863] [2025-02-06 12:04:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:31,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:04:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:31,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:04:31,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:04:31,721 INFO L87 Difference]: Start difference. First operand 202 states and 233 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-02-06 12:04:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:32,076 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2025-02-06 12:04:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:04:32,077 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-02-06 12:04:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:32,078 INFO L225 Difference]: With dead ends: 247 [2025-02-06 12:04:32,078 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 12:04:32,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:04:32,079 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 178 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:32,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 483 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:04:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 12:04:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 208. [2025-02-06 12:04:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 201 states have internal predecessors, (234), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2025-02-06 12:04:32,088 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 58 [2025-02-06 12:04:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:32,088 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2025-02-06 12:04:32,088 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-02-06 12:04:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2025-02-06 12:04:32,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:04:32,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:32,090 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-02-06 12:04:32,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:04:32,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:32,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:32,091 INFO L85 PathProgramCache]: Analyzing trace with hash -191212443, now seen corresponding path program 1 times [2025-02-06 12:04:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993109066] [2025-02-06 12:04:32,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:32,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:04:32,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:04:32,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:32,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993109066] [2025-02-06 12:04:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993109066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:04:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228861447] [2025-02-06 12:04:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:04:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:33,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:04:33,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:04:33,193 INFO L87 Difference]: Start difference. First operand 208 states and 242 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-02-06 12:04:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:33,742 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2025-02-06 12:04:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:04:33,742 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-02-06 12:04:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:33,743 INFO L225 Difference]: With dead ends: 246 [2025-02-06 12:04:33,744 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 12:04:33,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:04:33,744 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 250 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:33,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 640 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:04:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 12:04:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 208. [2025-02-06 12:04:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 162 states have (on average 1.4320987654320987) internal successors, (232), 201 states have internal predecessors, (232), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2025-02-06 12:04:33,750 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 58 [2025-02-06 12:04:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:33,751 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2025-02-06 12:04:33,751 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-02-06 12:04:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2025-02-06 12:04:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 12:04:33,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:33,752 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-02-06 12:04:33,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:04:33,752 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:33,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1118193023, now seen corresponding path program 1 times [2025-02-06 12:04:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909618841] [2025-02-06 12:04:33,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:33,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:04:33,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:04:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:33,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909618841] [2025-02-06 12:04:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909618841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611993829] [2025-02-06 12:04:33,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:33,918 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:33,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:04:34,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:04:34,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:04:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:34,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:04:34,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:34,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611993829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:34,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:34,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:04:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535793524] [2025-02-06 12:04:34,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:34,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:34,361 INFO L87 Difference]: Start difference. First operand 208 states and 240 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-02-06 12:04:34,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:34,395 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2025-02-06 12:04:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:34,396 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-02-06 12:04:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:34,398 INFO L225 Difference]: With dead ends: 237 [2025-02-06 12:04:34,398 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 12:04:34,398 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-02-06 12:04:34,399 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 17 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 539 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-02-06 12:04:34,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 539 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 12:04:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 232. [2025-02-06 12:04:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 186 states have (on average 1.4301075268817205) internal successors, (266), 225 states have internal predecessors, (266), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 274 transitions. [2025-02-06 12:04:34,410 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 274 transitions. Word has length 62 [2025-02-06 12:04:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:34,410 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 274 transitions. [2025-02-06 12:04:34,410 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-02-06 12:04:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 274 transitions. [2025-02-06 12:04:34,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:04:34,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:34,412 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-02-06 12:04:34,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:04:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 12:04:34,615 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:04:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -303998728, now seen corresponding path program 1 times [2025-02-06 12:04:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:34,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785009567] [2025-02-06 12:04:34,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:34,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:34,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:34,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:34,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785009567] [2025-02-06 12:04:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785009567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939544482] [2025-02-06 12:04:35,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:35,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:35,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:35,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:35,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:04:35,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:35,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:35,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:35,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:35,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 12:04:35,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:35,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:04:35,822 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 12:04:35,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 12:04:35,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:04:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:04:36,005 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:36,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:04:36,084 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:36,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:04:36,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:04:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 12:04:36,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:36,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_1878) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-02-06 12:04:36,225 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (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_1878) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-02-06 12:04:36,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1877))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1878)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:04:36,319 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1876 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1876))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1877)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1878)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-02-06 12:04:36,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:04:36,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-02-06 12:04:36,345 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 13200 treesize of output 10616 [2025-02-06 12:04:36,584 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 1708 treesize of output 1546 [2025-02-06 12:04:36,605 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 1546 treesize of output 1342 [2025-02-06 12:04:36,623 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 1342 treesize of output 1114 [2025-02-06 12:04:41,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:04:41,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 146 treesize of output 650 [2025-02-06 12:05:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-02-06 12:05:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939544482] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:03,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-02-06 12:05:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631432481] [2025-02-06 12:05:03,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:05:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:05:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=306, Unknown=12, NotChecked=156, Total=552 [2025-02-06 12:05:03,423 INFO L87 Difference]: Start difference. First operand 232 states and 274 transitions. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:04,284 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2025-02-06 12:05:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:05:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 12:05:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:04,286 INFO L225 Difference]: With dead ends: 269 [2025-02-06 12:05:04,286 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 12:05:04,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=361, Unknown=12, NotChecked=172, Total=650 [2025-02-06 12:05:04,288 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 175 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 778 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:04,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 914 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 675 Invalid, 0 Unknown, 778 Unchecked, 0.7s Time] [2025-02-06 12:05:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 12:05:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-02-06 12:05:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 224 states have internal predecessors, (260), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:05:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2025-02-06 12:05:04,294 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 63 [2025-02-06 12:05:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:04,294 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2025-02-06 12:05:04,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2025-02-06 12:05:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:05:04,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:04,295 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-02-06 12:05:04,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:05:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:05:04,497 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:05:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash -303998727, now seen corresponding path program 1 times [2025-02-06 12:05:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017983259] [2025-02-06 12:05:04,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:04,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:05:04,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:05:04,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:04,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017983259] [2025-02-06 12:05:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017983259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:05,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684868294] [2025-02-06 12:05:05,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:05:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:05,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:05,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:05:06,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:05:06,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:05:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:05:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:06,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:05:06,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:06,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:05:06,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:05:06,407 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:05:06,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:05:06,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:05:06,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:05:06,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:05:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:05:06,521 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:06,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:06,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:06,623 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:06,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:06,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:06,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:05:06,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 12:05:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:06,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:07,012 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_2109 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2108) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:05:07,027 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_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2107))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2106) .cse0 v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2108) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2106) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2107) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-02-06 12:05:07,043 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|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2107))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2106) .cse1 v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2108) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2106) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2107) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-02-06 12:05:07,073 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2104 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2104))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2105) .cse0 v_ArrVal_2106) (select (select (store .cse1 .cse0 v_ArrVal_2107) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2109))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2107 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2104 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2104))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2107))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2105) .cse3 v_ArrVal_2106) .cse4 v_ArrVal_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2108) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:05:07,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:07,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2025-02-06 12:05:07,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:07,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2025-02-06 12:05:07,121 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 852 treesize of output 716 [2025-02-06 12:05:07,133 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 1379 treesize of output 1307 [2025-02-06 12:05:07,152 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 679 treesize of output 583 [2025-02-06 12:05:07,159 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 583 treesize of output 511 [2025-02-06 12:05:07,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 511 treesize of output 487 [2025-02-06 12:05:07,172 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 463 [2025-02-06 12:05:07,180 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 463 treesize of output 391 [2025-02-06 12:05:07,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2025-02-06 12:05:07,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:07,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2025-02-06 12:05:07,232 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:07,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 354 [2025-02-06 12:05:07,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:07,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:07,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 12:05:07,339 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:05:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:05:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:07,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684868294] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:07,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:07,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 26 [2025-02-06 12:05:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317350030] [2025-02-06 12:05:07,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:07,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 12:05:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:07,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 12:05:07,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=407, Unknown=23, NotChecked=180, Total=702 [2025-02-06 12:05:07,350 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:08,639 INFO L93 Difference]: Finished difference Result 269 states and 296 transitions. [2025-02-06 12:05:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:05:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 12:05:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:08,641 INFO L225 Difference]: With dead ends: 269 [2025-02-06 12:05:08,641 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 12:05:08,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=207, Invalid=839, Unknown=26, NotChecked=260, Total=1332 [2025-02-06 12:05:08,642 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 187 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 8 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 829 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:08,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1087 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 985 Invalid, 18 Unknown, 829 Unchecked, 0.8s Time] [2025-02-06 12:05:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 12:05:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 231. [2025-02-06 12:05:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 224 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:05:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 264 transitions. [2025-02-06 12:05:08,648 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 264 transitions. Word has length 63 [2025-02-06 12:05:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 264 transitions. [2025-02-06 12:05:08,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 264 transitions. [2025-02-06 12:05:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 12:05:08,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:08,649 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-02-06 12:05:08,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:05:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:08,850 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-02-06 12:05:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1819503737, now seen corresponding path program 2 times [2025-02-06 12:05:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570239441] [2025-02-06 12:05:08,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:08,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 12:05:08,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 12:05:08,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:08,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:11,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570239441] [2025-02-06 12:05:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570239441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:11,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362145602] [2025-02-06 12:05:11,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:11,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:11,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:05:11,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 12:05:11,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 12:05:11,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:11,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:11,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 12:05:11,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:11,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:05:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:05:11,591 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:05:11,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:05:11,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:05:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:05:11,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:05:11,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:05:11,722 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:11,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:11,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:11,836 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:11,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:11,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:11,935 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:11,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:11,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:12,031 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:12,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:12,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:12,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:05:12,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 12:05:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:12,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:12,181 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_2368 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:05:12,193 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_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2368) |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_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2368 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2025-02-06 12:05:12,269 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_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2366) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2365))) (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~mem158#1.base| v_ArrVal_2366) .cse1 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:05:12,293 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|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2365))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) .cse1 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2366) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2025-02-06 12:05:12,424 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_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2364))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2363) .cse0 v_ArrVal_2366) (select (select (store .cse1 .cse0 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2368))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2364))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2365))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2363) .cse3 v_ArrVal_2366) .cse4 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:05:12,453 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_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2364))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2363) .cse1 v_ArrVal_2366) (select (select (store .cse2 .cse1 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2368))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2364))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2365))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2363) .cse4 v_ArrVal_2366) .cse5 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-02-06 12:05:12,483 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_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2364))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2365))) (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_2363) .cse1 v_ArrVal_2366) .cse2 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2364))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2363) .cse6 v_ArrVal_2366) (select (select (store .cse7 .cse6 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2368))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3)))))) is different from false [2025-02-06 12:05:12,501 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_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2362))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2364))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2361) .cse0 v_ArrVal_2363) .cse1 v_ArrVal_2366) (select (select (store .cse2 .cse1 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2368))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2362))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2364))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2365))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2361) .cse5 v_ArrVal_2363) .cse6 v_ArrVal_2366) .cse7 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-02-06 12:05:12,517 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_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2362))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2364))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2361) .cse1 v_ArrVal_2363) .cse2 v_ArrVal_2366) (select (select (store .cse3 .cse2 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2368))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3))) (forall ((v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2362))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2364))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2365))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2361) .cse6 v_ArrVal_2363) .cse7 v_ArrVal_2366) .cse8 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) is different from false [2025-02-06 12:05:12,967 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_2359 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (<= 0 (+ 3 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2360))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2362))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2364))) (let ((.cse2 (select (select .cse3 |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_2359) .cse0 v_ArrVal_2361) .cse1 v_ArrVal_2363) .cse2 v_ArrVal_2366) (select (select (store .cse3 .cse2 v_ArrVal_2365) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2368))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2368 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2366 (Array Int Int)) (v_ArrVal_2365 (Array Int Int)) (v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int)) (v_ArrVal_2362 (Array Int Int)) (v_ArrVal_2361 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2360))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2362))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2364))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2365))) (let ((.cse10 (select (select .cse11 |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_2359) .cse7 v_ArrVal_2361) .cse8 v_ArrVal_2363) .cse9 v_ArrVal_2366) .cse10 v_ArrVal_2368) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2367) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-02-06 12:05:13,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:13,013 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 418 treesize of output 419 [2025-02-06 12:05:13,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:13,023 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 406 treesize of output 239 [2025-02-06 12:05:13,106 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 5053042 treesize of output 4257114 [2025-02-06 12:05:15,922 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 6395194 treesize of output 6323762 [2025-02-06 12:05:17,457 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 17950 treesize of output 15646 [2025-02-06 12:05:17,526 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 15646 treesize of output 14110 [2025-02-06 12:05:17,609 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 14110 treesize of output 13822 [2025-02-06 12:05:17,676 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 13822 treesize of output 11824 [2025-02-06 12:05:17,741 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 11824 treesize of output 11632 [2025-02-06 12:05:17,807 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 11632 treesize of output 10864 [2025-02-06 12:05:17,872 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 10864 treesize of output 10480 [2025-02-06 12:05:17,938 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 10480 treesize of output 9310 [2025-02-06 12:05:18,004 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 9310 treesize of output 9118 [2025-02-06 12:05:19,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:19,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 833 treesize of output 834 [2025-02-06 12:05:19,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:19,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 821 treesize of output 462 [2025-02-06 12:05:19,912 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1118574 treesize of output 870678 [2025-02-06 12:05:20,209 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:20,209 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:20,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 12:05:20,306 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:05:20,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:05:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 145 trivial. 24 not checked. [2025-02-06 12:05:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362145602] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:20,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 19] total 45 [2025-02-06 12:05:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378914812] [2025-02-06 12:05:20,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 12:05:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:20,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 12:05:20,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1086, Unknown=22, NotChecked=770, Total=2070 [2025-02-06 12:05:20,315 INFO L87 Difference]: Start difference. First operand 231 states and 264 transitions. Second operand has 46 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 46 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)