./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:31:18,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:31:18,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:31:18,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:31:18,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:31:18,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:31:18,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:31:18,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:31:18,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:31:18,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:31:18,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:31:18,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:31:18,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:31:18,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:31:18,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:31:18,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:31:18,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:31:18,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:31:18,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:31:18,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:31:18,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e4c99f3f2b3af55bcad347a1b5bde7c2cd0c2bc102d0028ba92b38579ab012d [2025-03-17 13:31:18,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:31:18,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:31:18,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:31:18,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:31:18,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:31:18,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-03-17 13:31:20,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92934250/1b1b5e6245414a719643ff992b25496e/FLAG1a93a3d46 [2025-03-17 13:31:20,414 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:31:20,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-1.i [2025-03-17 13:31:20,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92934250/1b1b5e6245414a719643ff992b25496e/FLAG1a93a3d46 [2025-03-17 13:31:20,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92934250/1b1b5e6245414a719643ff992b25496e [2025-03-17 13:31:20,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:31:20,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:31:20,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:31:20,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:31:20,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:31:20,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:31:20" (1/1) ... [2025-03-17 13:31:20,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a92815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:20, skipping insertion in model container [2025-03-17 13:31:20,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:31:20" (1/1) ... [2025-03-17 13:31:20,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:31:21,055 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,060 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,062 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,065 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,066 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,067 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,068 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,071 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,072 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,081 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,083 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,090 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,093 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,096 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,117 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:31:21,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:31:21,152 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:31:21,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:31:21,318 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 13:31:21,325 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:31:21,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21 WrapperNode [2025-03-17 13:31:21,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:31:21,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:31:21,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:31:21,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:31:21,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,395 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 776 [2025-03-17 13:31:21,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:31:21,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:31:21,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:31:21,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:31:21,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,447 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 13:31:21,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:31:21,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:31:21,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:31:21,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:31:21,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (1/1) ... [2025-03-17 13:31:21,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:31:21,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:21,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:31:21,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:31:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:31:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 13:31:21,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 13:31:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 13:31:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:31:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:31:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 13:31:21,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:31:21,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:31:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 13:31:21,562 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:31:21,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 13:31:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 13:31:21,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 13:31:21,781 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:31:21,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:31:22,520 INFO L? ?]: Removed 348 outVars from TransFormulas that were not future-live. [2025-03-17 13:31:22,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:31:22,545 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:31:22,547 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:31:22,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:31:22 BoogieIcfgContainer [2025-03-17 13:31:22,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:31:22,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:31:22,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:31:22,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:31:22,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:31:20" (1/3) ... [2025-03-17 13:31:22,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c6538d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:31:22, skipping insertion in model container [2025-03-17 13:31:22,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:31:21" (2/3) ... [2025-03-17 13:31:22,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c6538d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:31:22, skipping insertion in model container [2025-03-17 13:31:22,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:31:22" (3/3) ... [2025-03-17 13:31:22,554 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-1.i [2025-03-17 13:31:22,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:31:22,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-1.i that has 3 procedures, 299 locations, 1 initial locations, 12 loop locations, and 125 error locations. [2025-03-17 13:31:22,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:31:22,616 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;@16ed078f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:31:22,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 125 error locations. [2025-03-17 13:31:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 289 states have internal predecessors, (325), 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-03-17 13:31:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:31:22,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:22,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:31:22,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:22,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash 12256, now seen corresponding path program 1 times [2025-03-17 13:31:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96193742] [2025-03-17 13:31:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:22,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:31:22,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:31:22,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:22,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96193742] [2025-03-17 13:31:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96193742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:31:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49689963] [2025-03-17 13:31:23,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:23,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:23,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:23,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:23,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,221 INFO L87 Difference]: Start difference. First operand has 299 states, 164 states have (on average 1.9817073170731707) internal successors, (325), 289 states have internal predecessors, (325), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:23,330 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2025-03-17 13:31:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:31:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:23,337 INFO L225 Difference]: With dead ends: 146 [2025-03-17 13:31:23,338 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 13:31:23,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,342 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:23,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 241 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 13:31:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-17 13:31:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 81 states have (on average 1.8518518518518519) internal successors, (150), 139 states have internal predecessors, (150), 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-03-17 13:31:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2025-03-17 13:31:23,379 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 2 [2025-03-17 13:31:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:23,379 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2025-03-17 13:31:23,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2025-03-17 13:31:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:31:23,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:23,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:31:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:31:23,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:23,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 12255, now seen corresponding path program 1 times [2025-03-17 13:31:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643979751] [2025-03-17 13:31:23,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:23,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:31:23,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:31:23,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:23,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:23,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643979751] [2025-03-17 13:31:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643979751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:23,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:23,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:31:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931481096] [2025-03-17 13:31:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:23,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:23,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:23,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,540 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:23,647 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2025-03-17 13:31:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 13:31:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:23,648 INFO L225 Difference]: With dead ends: 209 [2025-03-17 13:31:23,648 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 13:31:23,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,649 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 116 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:23,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 159 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 13:31:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2025-03-17 13:31:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 137 states have internal predecessors, (148), 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-03-17 13:31:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2025-03-17 13:31:23,663 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 2 [2025-03-17 13:31:23,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:23,664 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2025-03-17 13:31:23,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2025-03-17 13:31:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:31:23,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:23,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:31:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:31:23,665 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-03-17 13:31:23,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash 365405277, now seen corresponding path program 1 times [2025-03-17 13:31:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219537218] [2025-03-17 13:31:23,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:23,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:31:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:31:23,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:23,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219537218] [2025-03-17 13:31:23,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219537218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:23,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:23,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:31:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910427440] [2025-03-17 13:31:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,809 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:23,842 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2025-03-17 13:31:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:31:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:23,845 INFO L225 Difference]: With dead ends: 145 [2025-03-17 13:31:23,845 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 13:31:23,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:23,846 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:23,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:31:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 13:31:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-03-17 13:31:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.8170731707317074) internal successors, (149), 138 states have internal predecessors, (149), 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-03-17 13:31:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2025-03-17 13:31:23,857 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 5 [2025-03-17 13:31:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:23,859 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2025-03-17 13:31:23,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2025-03-17 13:31:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:31:23,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:23,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:31:23,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:31:23,860 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-03-17 13:31:23,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:23,860 INFO L85 PathProgramCache]: Analyzing trace with hash 365405438, now seen corresponding path program 1 times [2025-03-17 13:31:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948187256] [2025-03-17 13:31:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:23,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:31:23,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:31:23,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:23,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:24,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:24,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948187256] [2025-03-17 13:31:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948187256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:24,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:31:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14881815] [2025-03-17 13:31:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:24,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:31:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:24,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:31:24,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:31:24,086 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:24,211 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2025-03-17 13:31:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:31:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:31:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:24,212 INFO L225 Difference]: With dead ends: 144 [2025-03-17 13:31:24,212 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 13:31:24,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03-17 13:31:24,213 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 145 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:24,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 328 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 13:31:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-03-17 13:31:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 83 states have (on average 1.7951807228915662) internal successors, (149), 138 states have internal predecessors, (149), 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-03-17 13:31:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2025-03-17 13:31:24,218 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 5 [2025-03-17 13:31:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:24,218 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2025-03-17 13:31:24,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2025-03-17 13:31:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:31:24,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:24,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:31:24,219 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-03-17 13:31:24,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1948409926, now seen corresponding path program 1 times [2025-03-17 13:31:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:24,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12954870] [2025-03-17 13:31:24,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:24,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:24,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12954870] [2025-03-17 13:31:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12954870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303203379] [2025-03-17 13:31:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:24,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:24,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:31:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:24,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:24,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:24,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:31:24,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:24,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303203379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:24,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:31:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629745621] [2025-03-17 13:31:24,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:24,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:31:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:24,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:31:24,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:24,622 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:24,658 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2025-03-17 13:31:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:31:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:24,659 INFO L225 Difference]: With dead ends: 151 [2025-03-17 13:31:24,659 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 13:31:24,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:24,659 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:24,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 441 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:31:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 13:31:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 13:31:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 91 states have (on average 1.7472527472527473) internal successors, (159), 146 states have internal predecessors, (159), 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-03-17 13:31:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2025-03-17 13:31:24,667 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 8 [2025-03-17 13:31:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2025-03-17 13:31:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2025-03-17 13:31:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:31:24,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:24,667 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:24,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:31:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:24,868 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-03-17 13:31:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1948409765, now seen corresponding path program 1 times [2025-03-17 13:31:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859478359] [2025-03-17 13:31:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:24,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:24,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:24,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:24,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859478359] [2025-03-17 13:31:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859478359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:25,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869818092] [2025-03-17 13:31:25,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:25,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:25,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:25,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:31:25,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:31:25,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:31:25,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:25,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:25,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:31:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:25,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:25,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-17 13:31:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869818092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:31:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512511031] [2025-03-17 13:31:25,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:25,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:31:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:25,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:31:25,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:31:25,450 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:25,733 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2025-03-17 13:31:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:31:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 13:31:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:25,735 INFO L225 Difference]: With dead ends: 150 [2025-03-17 13:31:25,735 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 13:31:25,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:31:25,736 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 271 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:25,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 700 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 13:31:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-17 13:31:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 145 states have internal predecessors, (156), 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-03-17 13:31:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2025-03-17 13:31:25,747 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 8 [2025-03-17 13:31:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:25,747 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2025-03-17 13:31:25,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2025-03-17 13:31:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:31:25,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:25,747 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:31:25,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:25,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 13:31:25,948 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-03-17 13:31:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1814022685, now seen corresponding path program 2 times [2025-03-17 13:31:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684714653] [2025-03-17 13:31:25,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:25,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 13:31:25,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-17 13:31:25,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:31:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 13:31:26,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684714653] [2025-03-17 13:31:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684714653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:26,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8986763] [2025-03-17 13:31:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:26,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:31:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:26,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:31:26,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:26,101 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:26,201 INFO L93 Difference]: Finished difference Result 220 states and 239 transitions. [2025-03-17 13:31:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:31:26,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 13:31:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:26,203 INFO L225 Difference]: With dead ends: 220 [2025-03-17 13:31:26,203 INFO L226 Difference]: Without dead ends: 220 [2025-03-17 13:31:26,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:26,204 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 225 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:26,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 161 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-17 13:31:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2025-03-17 13:31:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 109 states have (on average 1.7064220183486238) internal successors, (186), 162 states have internal predecessors, (186), 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-03-17 13:31:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions. [2025-03-17 13:31:26,208 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 17 [2025-03-17 13:31:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:26,208 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 194 transitions. [2025-03-17 13:31:26,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions. [2025-03-17 13:31:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:31:26,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:26,209 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:31:26,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:31:26,209 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-03-17 13:31:26,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:26,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1814022686, now seen corresponding path program 1 times [2025-03-17 13:31:26,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:26,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166201044] [2025-03-17 13:31:26,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:26,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:26,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:31:26,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:31:26,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:26,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166201044] [2025-03-17 13:31:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166201044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:26,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122536330] [2025-03-17 13:31:26,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:26,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:26,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:31:26,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:31:26,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:31:26,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:26,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:31:26,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:26,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:31:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122536330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:26,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:31:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216229557] [2025-03-17 13:31:26,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:31:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:26,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:31:26,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:31:26,650 INFO L87 Difference]: Start difference. First operand 169 states and 194 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:26,706 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2025-03-17 13:31:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:31:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 13:31:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:26,708 INFO L225 Difference]: With dead ends: 187 [2025-03-17 13:31:26,708 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 13:31:26,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:31:26,709 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 4 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 583 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:31:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 13:31:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-17 13:31:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 180 states have internal predecessors, (204), 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-03-17 13:31:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 212 transitions. [2025-03-17 13:31:26,716 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 212 transitions. Word has length 17 [2025-03-17 13:31:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:26,716 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 212 transitions. [2025-03-17 13:31:26,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 212 transitions. [2025-03-17 13:31:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 13:31:26,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:26,717 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 13:31:26,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:26,922 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-03-17 13:31:26,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash -876407106, now seen corresponding path program 2 times [2025-03-17 13:31:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108533371] [2025-03-17 13:31:26,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:26,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 13:31:26,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-17 13:31:26,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:31:26,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108533371] [2025-03-17 13:31:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108533371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:27,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217497679] [2025-03-17 13:31:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:31:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:31:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:27,110 INFO L87 Difference]: Start difference. First operand 187 states and 212 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:27,169 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2025-03-17 13:31:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:31:27,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 13:31:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:27,170 INFO L225 Difference]: With dead ends: 190 [2025-03-17 13:31:27,170 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 13:31:27,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:27,171 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:27,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 243 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 13:31:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-17 13:31:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 130 states have (on average 1.5846153846153845) internal successors, (206), 182 states have internal predecessors, (206), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 214 transitions. [2025-03-17 13:31:27,176 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 214 transitions. Word has length 35 [2025-03-17 13:31:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:27,176 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 214 transitions. [2025-03-17 13:31:27,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:31:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 214 transitions. [2025-03-17 13:31:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:31:27,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:27,177 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:27,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:31:27,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:27,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2058703453, now seen corresponding path program 1 times [2025-03-17 13:31:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233052950] [2025-03-17 13:31:27,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:27,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:31:27,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:31:27,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:27,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:27,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:27,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233052950] [2025-03-17 13:31:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233052950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:27,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:31:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64374331] [2025-03-17 13:31:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:27,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:31:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:27,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:31:27,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:31:27,797 INFO L87 Difference]: Start difference. First operand 190 states and 214 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:27,945 INFO L93 Difference]: Finished difference Result 238 states and 270 transitions. [2025-03-17 13:31:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-03-17 13:31:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:27,947 INFO L225 Difference]: With dead ends: 238 [2025-03-17 13:31:27,947 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 13:31:27,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:31:27,947 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 163 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:27,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 468 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 13:31:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 189. [2025-03-17 13:31:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 130 states have (on average 1.5769230769230769) internal successors, (205), 181 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2025-03-17 13:31:27,951 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 43 [2025-03-17 13:31:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:27,951 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2025-03-17 13:31:27,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2025-03-17 13:31:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:31:27,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:27,953 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:27,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:31:27,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:27,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2058703454, now seen corresponding path program 1 times [2025-03-17 13:31:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850945621] [2025-03-17 13:31:27,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:27,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:31:27,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:31:28,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:28,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:28,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:28,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850945621] [2025-03-17 13:31:28,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850945621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:28,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577563839] [2025-03-17 13:31:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:28,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:28,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:28,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:28,180 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:28,284 INFO L93 Difference]: Finished difference Result 235 states and 253 transitions. [2025-03-17 13:31:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-03-17 13:31:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:28,286 INFO L225 Difference]: With dead ends: 235 [2025-03-17 13:31:28,286 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 13:31:28,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:28,287 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 96 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:28,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 164 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 13:31:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 184. [2025-03-17 13:31:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 176 states have internal predecessors, (200), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2025-03-17 13:31:28,294 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 43 [2025-03-17 13:31:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2025-03-17 13:31:28,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2025-03-17 13:31:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:31:28,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:28,296 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:28,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:31:28,296 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-03-17 13:31:28,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1298689611, now seen corresponding path program 1 times [2025-03-17 13:31:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629658260] [2025-03-17 13:31:28,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:28,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:31:28,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:31:28,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:28,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629658260] [2025-03-17 13:31:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629658260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:28,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:28,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:31:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578599467] [2025-03-17 13:31:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:31:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:28,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:31:28,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:31:28,642 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:28,816 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2025-03-17 13:31:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:31:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-17 13:31:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:28,818 INFO L225 Difference]: With dead ends: 253 [2025-03-17 13:31:28,818 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 13:31:28,818 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-03-17 13:31:28,819 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 315 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:28,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 213 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 13:31:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2025-03-17 13:31:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 189 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2025-03-17 13:31:28,823 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 46 [2025-03-17 13:31:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:28,824 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2025-03-17 13:31:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2025-03-17 13:31:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:31:28,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:28,824 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:28,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:31:28,825 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-03-17 13:31:28,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:28,825 INFO L85 PathProgramCache]: Analyzing trace with hash 197064957, now seen corresponding path program 1 times [2025-03-17 13:31:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512155614] [2025-03-17 13:31:28,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:28,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:31:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:31:28,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:28,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512155614] [2025-03-17 13:31:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512155614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:29,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:31:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045150168] [2025-03-17 13:31:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:29,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:29,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:29,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:29,029 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:29,119 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2025-03-17 13:31:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 13:31:29,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:29,121 INFO L225 Difference]: With dead ends: 237 [2025-03-17 13:31:29,121 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 13:31:29,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:29,121 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 89 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:29,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 160 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 13:31:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2025-03-17 13:31:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 195 states have internal predecessors, (230), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 238 transitions. [2025-03-17 13:31:29,125 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 238 transitions. Word has length 49 [2025-03-17 13:31:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:29,126 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 238 transitions. [2025-03-17 13:31:29,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 238 transitions. [2025-03-17 13:31:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:31:29,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:29,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:29,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:31:29,128 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-03-17 13:31:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 197064958, now seen corresponding path program 1 times [2025-03-17 13:31:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486346530] [2025-03-17 13:31:29,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:29,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:31:29,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:31:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:29,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486346530] [2025-03-17 13:31:29,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486346530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:29,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:29,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:31:29,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635902240] [2025-03-17 13:31:29,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:29,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:31:29,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:29,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:31:29,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:31:29,529 INFO L87 Difference]: Start difference. First operand 203 states and 238 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:29,795 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2025-03-17 13:31:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 13:31:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:29,797 INFO L225 Difference]: With dead ends: 246 [2025-03-17 13:31:29,797 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 13:31:29,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:29,797 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 197 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:29,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 284 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 13:31:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 203. [2025-03-17 13:31:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 195 states have internal predecessors, (229), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 237 transitions. [2025-03-17 13:31:29,805 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 237 transitions. Word has length 49 [2025-03-17 13:31:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 237 transitions. [2025-03-17 13:31:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 237 transitions. [2025-03-17 13:31:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:31:29,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:29,805 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] [2025-03-17 13:31:29,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:31:29,806 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-03-17 13:31:29,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1373748434, now seen corresponding path program 1 times [2025-03-17 13:31:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:29,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946768634] [2025-03-17 13:31:29,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:31:29,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:31:29,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:29,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-17 13:31:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946768634] [2025-03-17 13:31:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946768634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:31:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782791813] [2025-03-17 13:31:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:29,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:31:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:31:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:31:29,961 INFO L87 Difference]: Start difference. First operand 203 states and 237 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03-17 13:31:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:30,089 INFO L93 Difference]: Finished difference Result 241 states and 266 transitions. [2025-03-17 13:31:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:31:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 52 [2025-03-17 13:31:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:30,091 INFO L225 Difference]: With dead ends: 241 [2025-03-17 13:31:30,091 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 13:31:30,091 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-03-17 13:31:30,091 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 176 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:30,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 198 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 13:31:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 202. [2025-03-17 13:31:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.4836601307189543) internal successors, (227), 194 states have internal predecessors, (227), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 235 transitions. [2025-03-17 13:31:30,095 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 235 transitions. Word has length 52 [2025-03-17 13:31:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 235 transitions. [2025-03-17 13:31:30,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03-17 13:31:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 235 transitions. [2025-03-17 13:31:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:31:30,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:30,096 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] [2025-03-17 13:31:30,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:31:30,096 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-03-17 13:31:30,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1373748435, now seen corresponding path program 1 times [2025-03-17 13:31:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334812507] [2025-03-17 13:31:30,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:30,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:31:30,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:31:30,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:30,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 13:31:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334812507] [2025-03-17 13:31:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334812507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830319858] [2025-03-17 13:31:30,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:30,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:30,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:30,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:30,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 13:31:30,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:31:30,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:31:30,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:30,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:30,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 13:31:30,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 13:31:30,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 13:31:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830319858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:30,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 13:31:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-03-17 13:31:30,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149356197] [2025-03-17 13:31:30,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:31:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:30,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:31:30,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:31:30,562 INFO L87 Difference]: Start difference. First operand 202 states and 235 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-03-17 13:31:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:30,619 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2025-03-17 13:31:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:30,619 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), 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 52 [2025-03-17 13:31:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:30,620 INFO L225 Difference]: With dead ends: 207 [2025-03-17 13:31:30,620 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 13:31:30,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 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-03-17 13:31:30,621 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 18 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 618 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-03-17 13:31:30,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 618 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 13:31:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2025-03-17 13:31:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 153 states have (on average 1.477124183006536) internal successors, (226), 194 states have internal predecessors, (226), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2025-03-17 13:31:30,625 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 52 [2025-03-17 13:31:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2025-03-17 13:31:30,625 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), 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-03-17 13:31:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2025-03-17 13:31:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:31:30,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:30,626 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:30,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 13:31:30,827 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-03-17 13:31:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -457870781, now seen corresponding path program 1 times [2025-03-17 13:31:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304249223] [2025-03-17 13:31:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:30,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:31:30,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:31:30,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:30,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304249223] [2025-03-17 13:31:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304249223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:31:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413200695] [2025-03-17 13:31:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:31,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:31:31,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:31,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:31:31,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:31,115 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:31,285 INFO L93 Difference]: Finished difference Result 201 states and 232 transitions. [2025-03-17 13:31:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:31,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 13:31:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:31,287 INFO L225 Difference]: With dead ends: 201 [2025-03-17 13:31:31,287 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 13:31:31,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:31:31,287 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 95 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:31,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 400 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 13:31:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-17 13:31:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 193 states have internal predecessors, (224), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 232 transitions. [2025-03-17 13:31:31,291 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 232 transitions. Word has length 52 [2025-03-17 13:31:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:31,291 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 232 transitions. [2025-03-17 13:31:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 232 transitions. [2025-03-17 13:31:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:31:31,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:31,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:31:31,292 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-03-17 13:31:31,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -457870780, now seen corresponding path program 1 times [2025-03-17 13:31:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749672294] [2025-03-17 13:31:31,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:31,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:31:31,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:31:31,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:31,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749672294] [2025-03-17 13:31:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749672294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:31,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:31,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:31:31,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850699923] [2025-03-17 13:31:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:31,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:31:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:31,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:31:31,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:31,731 INFO L87 Difference]: Start difference. First operand 201 states and 232 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:31,884 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2025-03-17 13:31:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:31,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 13:31:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:31,885 INFO L225 Difference]: With dead ends: 200 [2025-03-17 13:31:31,885 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 13:31:31,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:31:31,886 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:31,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 378 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 13:31:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-17 13:31:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 153 states have (on average 1.4509803921568627) internal successors, (222), 192 states have internal predecessors, (222), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2025-03-17 13:31:31,890 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 52 [2025-03-17 13:31:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:31,890 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2025-03-17 13:31:31,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2025-03-17 13:31:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 13:31:31,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:31,891 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:31,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:31:31,891 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-03-17 13:31:31,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:31,891 INFO L85 PathProgramCache]: Analyzing trace with hash -857613193, now seen corresponding path program 1 times [2025-03-17 13:31:31,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473780354] [2025-03-17 13:31:31,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:31,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:31,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 13:31:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 13:31:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473780354] [2025-03-17 13:31:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473780354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:31,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:31:31,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622752672] [2025-03-17 13:31:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:31:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:31,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:31:31,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:31,989 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:32,007 INFO L93 Difference]: Finished difference Result 212 states and 245 transitions. [2025-03-17 13:31:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:31:32,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-17 13:31:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:32,009 INFO L225 Difference]: With dead ends: 212 [2025-03-17 13:31:32,009 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 13:31:32,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:31:32,010 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 6 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:32,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:31:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 13:31:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2025-03-17 13:31:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 155 states have (on average 1.4451612903225806) internal successors, (224), 194 states have internal predecessors, (224), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2025-03-17 13:31:32,015 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 56 [2025-03-17 13:31:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2025-03-17 13:31:32,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2025-03-17 13:31:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:31:32,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:32,016 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:31:32,016 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-03-17 13:31:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -815958605, now seen corresponding path program 1 times [2025-03-17 13:31:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633654215] [2025-03-17 13:31:32,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:32,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:31:32,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:31:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633654215] [2025-03-17 13:31:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633654215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:32,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:32,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 13:31:32,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866425150] [2025-03-17 13:31:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:32,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 13:31:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:32,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 13:31:32,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 13:31:32,519 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:32,770 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2025-03-17 13:31:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:31:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-17 13:31:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:32,772 INFO L225 Difference]: With dead ends: 246 [2025-03-17 13:31:32,772 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 13:31:32,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:31:32,773 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 257 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:32,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 432 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:31:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 13:31:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 208. [2025-03-17 13:31:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.4472049689440993) internal successors, (233), 200 states have internal predecessors, (233), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2025-03-17 13:31:32,778 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 57 [2025-03-17 13:31:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:32,779 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2025-03-17 13:31:32,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2025-03-17 13:31:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:31:32,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:32,780 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:32,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:31:32,780 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-03-17 13:31:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -815958604, now seen corresponding path program 1 times [2025-03-17 13:31:32,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:32,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317419465] [2025-03-17 13:31:32,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:32,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:32,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:31:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:31:32,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:32,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317419465] [2025-03-17 13:31:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317419465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:31:33,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:31:33,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:31:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427702346] [2025-03-17 13:31:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:31:33,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:31:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:33,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:31:33,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:31:33,424 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:33,816 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2025-03-17 13:31:33,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:31:33,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-17 13:31:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:33,817 INFO L225 Difference]: With dead ends: 245 [2025-03-17 13:31:33,817 INFO L226 Difference]: Without dead ends: 245 [2025-03-17 13:31:33,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:31:33,818 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 245 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:33,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 611 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 13:31:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-17 13:31:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2025-03-17 13:31:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.434782608695652) internal successors, (231), 200 states have internal predecessors, (231), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2025-03-17 13:31:33,822 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 57 [2025-03-17 13:31:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:33,822 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2025-03-17 13:31:33,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2025-03-17 13:31:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 13:31:33,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:33,823 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:33,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 13:31:33,824 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-03-17 13:31:33,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1408667792, now seen corresponding path program 1 times [2025-03-17 13:31:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715402542] [2025-03-17 13:31:33,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:33,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:31:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:31:33,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:33,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715402542] [2025-03-17 13:31:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715402542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473367291] [2025-03-17 13:31:33,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:33,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:33,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:33,946 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:33,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 13:31:34,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:31:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:31:34,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:34,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:34,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:31:34,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:34,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:34,242 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473367291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:34,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:34,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:31:34,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959429003] [2025-03-17 13:31:34,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:31:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:34,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:31:34,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:34,248 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:34,279 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2025-03-17 13:31:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:31:34,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-03-17 13:31:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:34,281 INFO L225 Difference]: With dead ends: 237 [2025-03-17 13:31:34,281 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 13:31:34,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:31:34,282 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 18 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:34,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 401 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 13:31:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 13:31:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 232. [2025-03-17 13:31:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 185 states have (on average 1.4324324324324325) internal successors, (265), 224 states have internal predecessors, (265), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 273 transitions. [2025-03-17 13:31:34,290 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 273 transitions. Word has length 61 [2025-03-17 13:31:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:34,290 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 273 transitions. [2025-03-17 13:31:34,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 273 transitions. [2025-03-17 13:31:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:31:34,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:34,291 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:34,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 13:31:34,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 13:31:34,491 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-03-17 13:31:34,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 719275194, now seen corresponding path program 1 times [2025-03-17 13:31:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367181853] [2025-03-17 13:31:34,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:34,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:31:34,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:31:34,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:35,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367181853] [2025-03-17 13:31:35,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367181853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:35,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283082412] [2025-03-17 13:31:35,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:35,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:35,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:35,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:35,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 13:31:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:31:35,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:31:35,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:35,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:35,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:31:35,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:35,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 13:31:35,332 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:31:35,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:31:35,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:31:35,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-17 13:31:35,462 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:35,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:31:35,515 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:35,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:31:35,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-17 13:31:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 13:31:35,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:35,671 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| |c_ULTIMATE.start_main_#t~mem157#1.base| 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-03-17 13:31:35,678 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-03-17 13:31:35,698 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-03-17 13:31:35,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:35,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-17 13:31:35,721 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-03-17 13:31:35,858 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-03-17 13:31:35,869 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-03-17 13:31:35,879 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-03-17 13:31:38,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:38,671 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-03-17 13:31:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283082412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:46,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:46,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2025-03-17 13:31:46,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218361289] [2025-03-17 13:31:46,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:46,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 13:31:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:46,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 13:31:46,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=322, Unknown=20, NotChecked=120, Total=552 [2025-03-17 13:31:46,985 INFO L87 Difference]: Start difference. First operand 232 states and 273 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:47,769 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2025-03-17 13:31:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:31:47,770 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-17 13:31:47,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:47,771 INFO L225 Difference]: With dead ends: 268 [2025-03-17 13:31:47,771 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 13:31:47,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=378, Unknown=21, NotChecked=132, Total=650 [2025-03-17 13:31:47,772 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 168 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:47,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1098 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 926 Invalid, 0 Unknown, 570 Unchecked, 0.7s Time] [2025-03-17 13:31:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 13:31:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 231. [2025-03-17 13:31:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 185 states have (on average 1.4) internal successors, (259), 223 states have internal predecessors, (259), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2025-03-17 13:31:47,778 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 62 [2025-03-17 13:31:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:47,778 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2025-03-17 13:31:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2025-03-17 13:31:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:31:47,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:47,779 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:47,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 13:31:47,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:47,980 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-03-17 13:31:47,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 719275195, now seen corresponding path program 1 times [2025-03-17 13:31:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240021709] [2025-03-17 13:31:47,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:47,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:48,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:31:48,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:31:48,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:48,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240021709] [2025-03-17 13:31:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240021709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258741648] [2025-03-17 13:31:49,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:31:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:49,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:49,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 13:31:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:31:49,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:31:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:31:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:49,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 13:31:49,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:49,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 13:31:49,332 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-03-17 13:31:49,339 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:31:49,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:31:49,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:31:49,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 13:31:49,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-17 13:31:49,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 13:31:49,415 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:49,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-17 13:31:49,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 13:31:49,504 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:49,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-17 13:31:49,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 13:31:49,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-17 13:31:49,556 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-03-17 13:31:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:49,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:49,634 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_2109 (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_2109) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2108 (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_2109) |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_2108) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-03-17 13:31:49,647 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 (+ |c_ULTIMATE.start_main_~j~0#1| (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))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 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-03-17 13:31:49,663 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-03-17 13:31:49,671 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-03-17 13:31:49,682 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-03-17 13:31:49,706 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-03-17 13:31:49,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:49,733 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-03-17 13:31:49,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:49,739 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-03-17 13:31:49,742 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-03-17 13:31:49,750 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-03-17 13:31:49,761 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-03-17 13:31:49,765 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-03-17 13:31:49,770 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-03-17 13:31:49,774 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-03-17 13:31:49,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 463 treesize of output 391 [2025-03-17 13:31:49,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:49,823 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-03-17 13:31:49,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:49,829 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-03-17 13:31:49,831 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:49,833 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-03-17 13:31:49,837 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:49,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:49,840 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-03-17 13:31:49,901 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 13:31:49,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 13:31:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-03-17 13:31:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258741648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:49,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 27 [2025-03-17 13:31:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142375716] [2025-03-17 13:31:49,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 13:31:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:49,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 13:31:49,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=390, Unknown=6, NotChecked=270, Total=756 [2025-03-17 13:31:49,909 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:50,596 INFO L93 Difference]: Finished difference Result 268 states and 296 transitions. [2025-03-17 13:31:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 13:31:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-17 13:31:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:50,597 INFO L225 Difference]: With dead ends: 268 [2025-03-17 13:31:50,597 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 13:31:50,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=660, Unknown=6, NotChecked=354, Total=1190 [2025-03-17 13:31:50,598 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 269 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1177 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:50,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 890 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 739 Invalid, 0 Unknown, 1177 Unchecked, 0.4s Time] [2025-03-17 13:31:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 13:31:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 231. [2025-03-17 13:31:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 223 states have internal predecessors, (257), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2025-03-17 13:31:50,603 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 62 [2025-03-17 13:31:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:50,603 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2025-03-17 13:31:50,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2025-03-17 13:31:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 13:31:50,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:50,604 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:50,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 13:31:50,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:50,805 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-03-17 13:31:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 521716244, now seen corresponding path program 2 times [2025-03-17 13:31:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180349799] [2025-03-17 13:31:50,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:50,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 13:31:50,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 13:31:50,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:31:50,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:51,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180349799] [2025-03-17 13:31:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180349799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44452967] [2025-03-17 13:31:51,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:51,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:51,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:51,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 13:31:52,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-17 13:31:52,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 13:31:52,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:31:52,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:52,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 13:31:52,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:52,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-03-17 13:31:52,367 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-03-17 13:31:52,375 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:31:52,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:31:52,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:31:52,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 13:31:52,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-17 13:31:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 13:31:52,498 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:52,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-17 13:31:52,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 13:31:52,568 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-17 13:31:52,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 13:31:52,642 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:31:52,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-03-17 13:31:52,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 13:31:52,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-03-17 13:31:52,704 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-03-17 13:31:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:52,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:52,795 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_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2353 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2025-03-17 13:31:52,861 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_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2353 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)))))) is different from false [2025-03-17 13:31:52,877 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_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (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_2352) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 2))) (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2351))) (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_2352) .cse1 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 3) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-03-17 13:31:52,981 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_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2352) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2351) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2351))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2352) .cse2 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-03-17 13:31:52,995 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_2349 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2350))) (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~mem157#1.base| v_ArrVal_2349) .cse0 v_ArrVal_2352) (select (select (store .cse1 .cse0 v_ArrVal_2351) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2353))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2350))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2351))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2349) .cse3 v_ArrVal_2352) .cse4 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-03-17 13:31:53,679 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_2349 (Array Int Int)) (v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2347 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2348))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2350))) (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_~mem_track~0#1.base| v_ArrVal_2347) .cse0 v_ArrVal_2349) .cse1 v_ArrVal_2352) (select (select (store .cse2 .cse1 v_ArrVal_2351) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2353))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (forall ((v_ArrVal_2349 (Array Int Int)) (v_ArrVal_2348 (Array Int Int)) (v_ArrVal_2347 (Array Int Int)) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2348))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2350))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2351))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ 3 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2347) .cse5 v_ArrVal_2349) .cse6 v_ArrVal_2352) .cse7 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-03-17 13:31:53,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:53,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2025-03-17 13:31:53,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:53,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2025-03-17 13:31:53,762 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 909604 treesize of output 761196 [2025-03-17 13:31:54,045 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 87371 treesize of output 86019 [2025-03-17 13:31:54,184 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 2511 treesize of output 2127 [2025-03-17 13:31:54,198 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 2127 treesize of output 1911 [2025-03-17 13:31:54,228 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 1911 treesize of output 1767 [2025-03-17 13:31:54,239 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 1767 treesize of output 1431 [2025-03-17 13:31:54,249 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 1431 treesize of output 1335 [2025-03-17 13:31:54,263 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 1335 treesize of output 1287 [2025-03-17 13:31:54,273 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 1287 treesize of output 1263 [2025-03-17 13:31:54,283 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 1263 treesize of output 1167 [2025-03-17 13:31:54,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:54,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-03-17 13:31:54,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:31:54,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-03-17 13:31:54,568 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:54,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 347 [2025-03-17 13:31:54,575 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:54,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 13:31:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-03-17 13:31:54,667 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 13:31:54,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-03-17 13:31:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 145 trivial. 7 not checked. [2025-03-17 13:31:54,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44452967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:54,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2025-03-17 13:31:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052913685] [2025-03-17 13:31:54,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:54,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 13:31:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:54,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 13:31:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=894, Unknown=19, NotChecked=402, Total=1482 [2025-03-17 13:31:54,682 INFO L87 Difference]: Start difference. First operand 231 states and 265 transitions. Second operand has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:55,715 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)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse2) (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (forall ((v_ArrVal_2353 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| .cse2 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1)))) is different from false [2025-03-17 13:31:55,845 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)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2353 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| .cse2 1) (select |c_#length| .cse0)) (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2353) |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| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2353 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2354) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| .cse2)) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1|)) (<= (+ |c_ULTIMATE.start_main_#t~mem158#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem158#1.base|)) (forall ((v_ArrVal_2353 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2025-03-17 13:31:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:56,447 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2025-03-17 13:31:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 13:31:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-03-17 13:31:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:56,448 INFO L225 Difference]: With dead ends: 239 [2025-03-17 13:31:56,448 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 13:31:56,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=349, Invalid=1620, Unknown=43, NotChecked=744, Total=2756 [2025-03-17 13:31:56,449 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 7 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:56,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1784 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 903 Invalid, 36 Unknown, 576 Unchecked, 0.9s Time] [2025-03-17 13:31:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 13:31:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-17 13:31:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 231 states have internal predecessors, (265), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 273 transitions. [2025-03-17 13:31:56,453 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 273 transitions. Word has length 67 [2025-03-17 13:31:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:56,453 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 273 transitions. [2025-03-17 13:31:56,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.263157894736842) internal successors, (86), 39 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 273 transitions. [2025-03-17 13:31:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 13:31:56,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:56,454 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:56,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:56,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 13:31:56,659 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:56,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 136324023, now seen corresponding path program 2 times [2025-03-17 13:31:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531764701] [2025-03-17 13:31:56,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:56,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-17 13:31:56,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 13:31:56,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:31:56,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:31:56,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531764701] [2025-03-17 13:31:56,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531764701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:31:56,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829375942] [2025-03-17 13:31:56,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:31:56,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:31:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:31:56,958 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:31:56,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 13:31:57,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-17 13:31:57,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 13:31:57,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 13:31:57,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:31:57,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:31:57,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:31:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:57,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:31:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:31:57,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829375942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:31:57,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:31:57,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:31:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761823486] [2025-03-17 13:31:57,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:31:57,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:31:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:31:57,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:31:57,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:31:57,333 INFO L87 Difference]: Start difference. First operand 239 states and 273 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:31:57,400 INFO L93 Difference]: Finished difference Result 300 states and 340 transitions. [2025-03-17 13:31:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:31:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2025-03-17 13:31:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:31:57,401 INFO L225 Difference]: With dead ends: 300 [2025-03-17 13:31:57,401 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 13:31:57,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:31:57,402 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 32 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:31:57,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 411 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:31:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 13:31:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 291. [2025-03-17 13:31:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 245 states have (on average 1.3551020408163266) internal successors, (332), 283 states have internal predecessors, (332), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 13:31:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2025-03-17 13:31:57,407 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 76 [2025-03-17 13:31:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:31:57,408 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2025-03-17 13:31:57,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:31:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2025-03-17 13:31:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 13:31:57,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:31:57,409 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:31:57,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 13:31:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 13:31:57,610 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 122 more)] === [2025-03-17 13:31:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:31:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1818551301, now seen corresponding path program 3 times [2025-03-17 13:31:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:31:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479786102] [2025-03-17 13:31:57,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:31:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:31:57,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 11 equivalence classes. [2025-03-17 13:31:57,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 67 of 82 statements. [2025-03-17 13:31:57,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 13:31:57,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:32:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:32:00,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:32:00,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479786102] [2025-03-17 13:32:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479786102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:32:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581986160] [2025-03-17 13:32:00,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 13:32:00,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:32:00,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:32:00,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:32:00,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 13:32:00,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 11 equivalence classes. [2025-03-17 13:32:04,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 67 of 82 statements. [2025-03-17 13:32:04,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 13:32:04,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:32:04,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 13:32:04,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:32:04,905 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 13:32:04,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-03-17 13:32:04,981 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-03-17 13:32:04,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 13:32:04,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 13:32:05,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 13:32:05,031 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 1 [2025-03-17 13:32:05,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 13:32:05,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-17 13:32:05,186 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 13:32:05,301 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 13:32:05,421 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 13:32:05,552 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 13:32:05,687 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 13:32:05,828 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 13:32:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 13:32:05,832 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 33 treesize of output 18 [2025-03-17 13:32:05,953 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 24 treesize of output 12 [2025-03-17 13:32:05,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 13:32:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:32:06,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:32:06,345 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_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 1) 0) (forall ((v_ArrVal_2901 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2900))) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2899))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse3 .cse4 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 1) 0)))))) is different from false [2025-03-17 13:32:06,377 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 ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2900))) (or (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2899))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse0 .cse1 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 1) 0)))) (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_2900))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_2901 (Array Int Int))) (< .cse5 (+ 2 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (< (+ .cse5 |c_ULTIMATE.start_main_~j~0#1| 1) 0)))))))) is different from false [2025-03-17 13:32:06,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 2) 0))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2900))) (or (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 2) 0) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2899))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse4 .cse5 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2025-03-17 13:32:06,437 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_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2897))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2898) .cse5 v_ArrVal_2900))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2899))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) 0)))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2897))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2898) .cse9 v_ArrVal_2900))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse6 (+ (select (select (store .cse7 (select (select (store .cse8 .cse9 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2)) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse6) 0))))))))) is different from false [2025-03-17 13:32:06,476 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2897))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2898) .cse5 v_ArrVal_2900))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2899))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store .cse0 .cse2 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2897))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2898) .cse10 v_ArrVal_2900))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 .cse7) 0) (< .cse7 (+ 2 (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))) is different from false [2025-03-17 13:32:06,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 ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2897))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2898) .cse3 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 .cse0) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2897))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2898) .cse10 v_ArrVal_2900))) (or (let ((.cse8 (store .cse9 .cse10 v_ArrVal_2899))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store .cse6 .cse7 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) 0))))))))) is different from false [2025-03-17 13:32:06,554 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2895))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse6 .cse5 v_ArrVal_2897))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2896) .cse5 v_ArrVal_2898) .cse3 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2)) (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 3) 0))))))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2895))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_2897))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2896) .cse12 v_ArrVal_2898) .cse11 v_ArrVal_2900))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) 0) (let ((.cse9 (store .cse10 .cse11 v_ArrVal_2899))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse7 .cse8 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))) is different from false [2025-03-17 13:32:07,401 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2893))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_2895))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse7 .cse6 v_ArrVal_2897))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2894) .cse5 v_ArrVal_2896) .cse6 v_ArrVal_2898) .cse3 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 4) 0) (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2)))))))))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2893))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2895))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_2897))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse9 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem158#1.base| v_ArrVal_2894) .cse14 v_ArrVal_2896) .cse15 v_ArrVal_2898) .cse13 v_ArrVal_2900))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) 0) (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2899))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse9 .cse10 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))))) is different from false [2025-03-17 13:32:07,560 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 ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2893))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2895))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_2897))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2894) .cse6 v_ArrVal_2896) .cse7 v_ArrVal_2898) .cse3 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 4) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_2893))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_2895))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_2897))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2894) .cse15 v_ArrVal_2896) .cse16 v_ArrVal_2898) .cse14 v_ArrVal_2900))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) 0) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2899))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store .cse10 .cse11 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))))))) is different from false [2025-03-17 13:32:12,371 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2892))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2893))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2895))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse8 .cse7 v_ArrVal_2897))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2891) .cse5 v_ArrVal_2894) .cse6 v_ArrVal_2896) .cse7 v_ArrVal_2898) .cse3 v_ArrVal_2900))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ .cse0 4) 0))))))))))))) (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2892))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_2893))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2895))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse19 .cse18 v_ArrVal_2897))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem157#1.base| v_ArrVal_2891) .cse16 v_ArrVal_2894) .cse17 v_ArrVal_2896) .cse18 v_ArrVal_2898) .cse15 v_ArrVal_2900))) (or (< (+ (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4) 0) (let ((.cse13 (store .cse14 .cse15 v_ArrVal_2899))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ 5 (select (select (store .cse11 .cse12 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))))))))) is different from false [2025-03-17 13:32:14,066 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 ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2892))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2893))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2895))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse10 .cse9 v_ArrVal_2897))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2891) .cse7 v_ArrVal_2894) .cse8 v_ArrVal_2896) .cse9 v_ArrVal_2898) .cse5 v_ArrVal_2900))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2899))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ 5 (select (select (store .cse0 .cse1 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) 0)))))))))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_2892))) (let ((.cse17 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse21 (store .cse22 .cse17 v_ArrVal_2893))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse18 v_ArrVal_2895))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse15 (store .cse20 .cse19 v_ArrVal_2897))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse14 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_2891) .cse17 v_ArrVal_2894) .cse18 v_ArrVal_2896) .cse19 v_ArrVal_2898) .cse16 v_ArrVal_2900))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse13 (+ 2 (select (select (store .cse14 (select (select (store .cse15 .cse16 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ .cse13 4) 0)))))))))))))))) is different from false [2025-03-17 13:32:18,146 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_2902 (Array Int Int)) (v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2889 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2890 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2890))) (let ((.cse6 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store .cse13 .cse6 v_ArrVal_2892))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2893))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2895))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse10 .cse9 v_ArrVal_2897))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2889) .cse6 v_ArrVal_2891) .cse7 v_ArrVal_2894) .cse8 v_ArrVal_2896) .cse9 v_ArrVal_2898) .cse5 v_ArrVal_2900))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2899))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ 5 (select (select (store .cse0 .cse2 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2902) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2889 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2895 (Array Int Int)) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int)) (v_ArrVal_2890 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2890))) (let ((.cse18 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse24 (store .cse25 .cse18 v_ArrVal_2892))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_2893))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_2895))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store .cse22 .cse21 v_ArrVal_2897))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2889) .cse18 v_ArrVal_2891) .cse19 v_ArrVal_2894) .cse20 v_ArrVal_2896) .cse21 v_ArrVal_2898) .cse17 v_ArrVal_2900))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ 4 .cse14) 0) (< .cse14 (+ 2 (select (select (store .cse15 (select (select (store .cse16 .cse17 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))))))))))))) is different from false [2025-03-17 13:32:18,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:32:18,236 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 7495 treesize of output 7448 [2025-03-17 13:32:18,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:32:18,253 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 7435 treesize of output 4052