./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/logname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:03:58,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:03:58,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:03:58,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:03:58,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:03:58,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:03:58,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:03:58,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:03:58,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:03:58,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:03:58,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:03:58,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:03:58,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:03:58,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:03:58,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:03:58,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:03:58,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:03:58,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:03:58,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:03:58,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:03:58,974 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c974ed4f1d4c3d5b838cbfadb19eec8f0977d5398d9ade006a615b896bd7b5af [2025-02-06 12:03:59,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:03:59,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:03:59,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:03:59,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:03:59,290 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:03:59,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-02-06 12:04:00,750 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0910d35ff/a784c74e52294321ad464eb10bf43b7c/FLAG30159aeef [2025-02-06 12:04:01,192 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:04:01,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-02-06 12:04:01,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0910d35ff/a784c74e52294321ad464eb10bf43b7c/FLAG30159aeef [2025-02-06 12:04:01,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0910d35ff/a784c74e52294321ad464eb10bf43b7c [2025-02-06 12:04:01,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:04:01,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:04:01,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:01,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:04:01,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:04:01,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:01" (1/1) ... [2025-02-06 12:04:01,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:01, skipping insertion in model container [2025-02-06 12:04:01,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:01" (1/1) ... [2025-02-06 12:04:01,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:04:02,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-02-06 12:04:02,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-02-06 12:04:02,073 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,077 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,079 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,079 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,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-02-06 12:04:02,086 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,089 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,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-02-06 12:04:02,098 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,107 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:04:02,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-02-06 12:04:02,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:02,151 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:04:02,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:04:02,379 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 12:04:02,386 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:04:02,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02 WrapperNode [2025-02-06 12:04:02,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:04:02,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:02,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:04:02,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:04:02,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,477 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 799 [2025-02-06 12:04:02,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:04:02,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:04:02,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:04:02,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:04:02,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,520 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 12:04:02,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:04:02,595 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:04:02,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:04:02,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:04:02,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (1/1) ... [2025-02-06 12:04:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:04:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:02,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:04:02,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:04:02,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 12:04:02,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:04:02,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:04:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 12:04:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 12:04:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 12:04:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 12:04:02,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:04:02,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:04:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 12:04:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 12:04:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-02-06 12:04:02,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-02-06 12:04:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 12:04:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 12:04:02,966 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:04:02,968 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:04:03,718 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: havoc __main_~return_value_fflush_all$1~0#1; [2025-02-06 12:04:03,718 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: havoc getlogin_r_~ret~0#1; [2025-02-06 12:04:03,815 INFO L? ?]: Removed 349 outVars from TransFormulas that were not future-live. [2025-02-06 12:04:03,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:04:03,837 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:04:03,837 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:04:03,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:03 BoogieIcfgContainer [2025-02-06 12:04:03,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:04:03,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:04:03,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:04:03,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:04:03,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:04:01" (1/3) ... [2025-02-06 12:04:03,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4415394c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:03, skipping insertion in model container [2025-02-06 12:04:03,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:02" (2/3) ... [2025-02-06 12:04:03,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4415394c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:03, skipping insertion in model container [2025-02-06 12:04:03,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:03" (3/3) ... [2025-02-06 12:04:03,847 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-02-06 12:04:03,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:04:03,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 308 locations, 1 initial locations, 12 loop locations, and 119 error locations. [2025-02-06 12:04:03,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:04:03,908 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;@47d8c8a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:04:03,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-02-06 12:04:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 175 states have (on average 1.88) internal successors, (329), 294 states have internal predecessors, (329), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 12:04:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:03,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:03,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:03,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:03,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash 389223, now seen corresponding path program 1 times [2025-02-06 12:04:03,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113384564] [2025-02-06 12:04:03,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:04,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:04,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:04,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:04,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:04,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-02-06 12:04:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113384564] [2025-02-06 12:04:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113384564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562977155] [2025-02-06 12:04:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:04,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:04,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:04,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:04,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:04,565 INFO L87 Difference]: Start difference. First operand has 308 states, 175 states have (on average 1.88) internal successors, (329), 294 states have internal predecessors, (329), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:04,688 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2025-02-06 12:04:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:04:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:04,695 INFO L225 Difference]: With dead ends: 111 [2025-02-06 12:04:04,695 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 12:04:04,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:04,700 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 91 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:04,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 88 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 12:04:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 12:04:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.6865671641791045) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2025-02-06 12:04:04,737 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 3 [2025-02-06 12:04:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:04,737 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2025-02-06 12:04:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2025-02-06 12:04:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:04:04,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:04,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:04:04,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:04:04,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:04,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash 389224, now seen corresponding path program 1 times [2025-02-06 12:04:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475357537] [2025-02-06 12:04:04,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:04,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:04:04,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:04:04,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:05,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:05,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475357537] [2025-02-06 12:04:05,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475357537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:05,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:05,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778668535] [2025-02-06 12:04:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:05,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:05,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:05,137 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:05,245 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2025-02-06 12:04:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:05,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:04:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:05,252 INFO L225 Difference]: With dead ends: 110 [2025-02-06 12:04:05,252 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 12:04:05,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:05,253 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:05,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 12:04:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 12:04:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.671641791044776) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-02-06 12:04:05,263 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 3 [2025-02-06 12:04:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-02-06 12:04:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-02-06 12:04:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:04:05,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:05,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:04:05,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:04:05,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:05,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1289234818, now seen corresponding path program 1 times [2025-02-06 12:04:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049970351] [2025-02-06 12:04:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:05,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:04:05,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:04:05,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:05,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049970351] [2025-02-06 12:04:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049970351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184553750] [2025-02-06 12:04:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:05,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:04:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:05,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:04:05,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:05,595 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:05,719 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2025-02-06 12:04:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:04:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:04:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:05,722 INFO L225 Difference]: With dead ends: 113 [2025-02-06 12:04:05,722 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 12:04:05,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:05,723 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:05,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 254 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 12:04:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 12:04:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 105 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-02-06 12:04:05,733 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 6 [2025-02-06 12:04:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:05,733 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-02-06 12:04:05,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-02-06 12:04:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:04:05,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:05,734 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:04:05,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1996612125, now seen corresponding path program 1 times [2025-02-06 12:04:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895047850] [2025-02-06 12:04:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:05,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:05,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:05,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:05,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:06,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895047850] [2025-02-06 12:04:06,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895047850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:06,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648039987] [2025-02-06 12:04:06,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:06,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:06,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:06,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:04:06,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:04:06,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:04:06,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:06,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:06,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:04:06,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:06,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:06,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:04:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648039987] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:04:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548219860] [2025-02-06 12:04:06,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:06,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:04:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:06,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:04:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:04:06,588 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:06,958 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2025-02-06 12:04:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:04:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:04:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:06,960 INFO L225 Difference]: With dead ends: 116 [2025-02-06 12:04:06,960 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 12:04:06,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:04:06,961 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 200 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:06,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 528 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:04:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 12:04:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 12:04:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2025-02-06 12:04:06,968 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 9 [2025-02-06 12:04:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2025-02-06 12:04:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2025-02-06 12:04:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 12:04:06,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:06,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:06,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:04:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:07,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1383516002, now seen corresponding path program 1 times [2025-02-06 12:04:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260675393] [2025-02-06 12:04:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:07,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:04:07,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:04:07,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:07,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:07,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260675393] [2025-02-06 12:04:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260675393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306232678] [2025-02-06 12:04:07,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:07,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:07,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:07,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:04:07,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 12:04:07,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 12:04:07,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:07,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:07,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:04:07,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:07,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:07,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306232678] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:07,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 12:04:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616737268] [2025-02-06 12:04:07,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:04:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:04:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:04:07,869 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:07,929 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-02-06 12:04:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:04:07,929 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 15 [2025-02-06 12:04:07,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:07,930 INFO L225 Difference]: With dead ends: 131 [2025-02-06 12:04:07,930 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 12:04:07,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:04:07,931 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:07,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 12:04:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-06 12:04:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 89 states have (on average 1.4943820224719102) internal successors, (133), 124 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2025-02-06 12:04:07,940 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 15 [2025-02-06 12:04:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:07,941 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2025-02-06 12:04:07,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2025-02-06 12:04:07,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:04:07,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:07,941 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:07,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:04:08,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:08,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:08,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1068010845, now seen corresponding path program 2 times [2025-02-06 12:04:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429532754] [2025-02-06 12:04:08,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:08,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:04:08,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-02-06 12:04:08,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:08,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-06 12:04:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429532754] [2025-02-06 12:04:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429532754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:04:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753895017] [2025-02-06 12:04:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:08,522 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:08,577 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2025-02-06 12:04:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 12:04:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:08,578 INFO L225 Difference]: With dead ends: 130 [2025-02-06 12:04:08,578 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 12:04:08,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:08,579 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 105 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:08,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 12:04:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 12:04:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 123 states have internal predecessors, (132), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-02-06 12:04:08,586 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 30 [2025-02-06 12:04:08,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:08,586 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-02-06 12:04:08,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-02-06 12:04:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:04:08,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:08,587 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:08,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:04:08,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:08,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1068010846, now seen corresponding path program 1 times [2025-02-06 12:04:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008882215] [2025-02-06 12:04:08,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:04:08,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:04:08,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:08,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:08,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008882215] [2025-02-06 12:04:08,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008882215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939684155] [2025-02-06 12:04:08,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:08,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:08,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:08,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:08,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:04:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:04:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:04:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:09,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:04:09,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:09,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:04:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939684155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:09,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-06 12:04:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802975201] [2025-02-06 12:04:09,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:04:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:09,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:04:09,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:04:09,414 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:09,475 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-02-06 12:04:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:04:09,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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 30 [2025-02-06 12:04:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:09,478 INFO L225 Difference]: With dead ends: 136 [2025-02-06 12:04:09,478 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 12:04:09,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:04:09,478 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:09,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 342 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 12:04:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-06 12:04:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 129 states have internal predecessors, (138), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-02-06 12:04:09,487 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 30 [2025-02-06 12:04:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:09,487 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-02-06 12:04:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-02-06 12:04:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:04:09,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:09,492 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:09,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:04:09,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:09,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:09,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:09,693 INFO L85 PathProgramCache]: Analyzing trace with hash 802518846, now seen corresponding path program 2 times [2025-02-06 12:04:09,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:09,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72421518] [2025-02-06 12:04:09,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:04:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:09,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:04:09,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-02-06 12:04:09,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:04:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72421518] [2025-02-06 12:04:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72421518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915126522] [2025-02-06 12:04:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:10,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:04:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:10,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:04:10,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:10,006 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:10,151 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-02-06 12:04:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:04:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-06 12:04:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:10,153 INFO L225 Difference]: With dead ends: 135 [2025-02-06 12:04:10,153 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 12:04:10,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:10,153 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 284 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:10,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 67 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 12:04:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 12:04:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 128 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-02-06 12:04:10,158 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 36 [2025-02-06 12:04:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-02-06 12:04:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:04:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-02-06 12:04:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:04:10,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:10,160 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:10,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:04:10,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:10,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:10,161 INFO L85 PathProgramCache]: Analyzing trace with hash -430964174, now seen corresponding path program 1 times [2025-02-06 12:04:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:10,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448513784] [2025-02-06 12:04:10,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:10,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:10,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:04:10,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:04:10,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:10,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448513784] [2025-02-06 12:04:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448513784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:10,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:10,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:10,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171248721] [2025-02-06 12:04:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:10,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:10,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:10,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:10,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:10,501 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:10,605 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2025-02-06 12:04:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:04:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:10,606 INFO L225 Difference]: With dead ends: 130 [2025-02-06 12:04:10,606 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 12:04:10,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:10,607 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 71 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:10,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 94 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 12:04:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 12:04:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 123 states have internal predecessors, (132), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-02-06 12:04:10,611 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 44 [2025-02-06 12:04:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-02-06 12:04:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-02-06 12:04:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 12:04:10,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:10,613 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:10,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:04:10,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:10,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash -430964173, now seen corresponding path program 1 times [2025-02-06 12:04:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:10,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437199870] [2025-02-06 12:04:10,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:10,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 12:04:10,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 12:04:10,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:10,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437199870] [2025-02-06 12:04:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437199870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:11,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:11,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:04:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269205759] [2025-02-06 12:04:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:11,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:11,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:11,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:11,340 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:11,420 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2025-02-06 12:04:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-02-06 12:04:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:11,421 INFO L225 Difference]: With dead ends: 130 [2025-02-06 12:04:11,421 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 12:04:11,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:11,422 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:11,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 367 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 12:04:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-02-06 12:04:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 122 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-02-06 12:04:11,425 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 44 [2025-02-06 12:04:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:11,426 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-02-06 12:04:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-02-06 12:04:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:04:11,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:11,427 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:04:11,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1196151101, now seen corresponding path program 1 times [2025-02-06 12:04:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774764240] [2025-02-06 12:04:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:11,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:04:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:04:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:11,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774764240] [2025-02-06 12:04:11,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774764240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:11,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:04:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356370341] [2025-02-06 12:04:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:11,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:11,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:11,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:11,805 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:11,954 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2025-02-06 12:04:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:04:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:11,955 INFO L225 Difference]: With dead ends: 148 [2025-02-06 12:04:11,955 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 12:04:11,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:11,956 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 208 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:11,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 168 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 12:04:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2025-02-06 12:04:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 136 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2025-02-06 12:04:11,964 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 47 [2025-02-06 12:04:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:11,964 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2025-02-06 12:04:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2025-02-06 12:04:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:04:11,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:11,967 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:04:11,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1196152030, now seen corresponding path program 1 times [2025-02-06 12:04:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152077570] [2025-02-06 12:04:11,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:12,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:04:12,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:04:12,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:12,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:12,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:12,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152077570] [2025-02-06 12:04:12,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152077570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:12,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:12,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:12,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010185354] [2025-02-06 12:04:12,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:12,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:04:12,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:12,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:04:12,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:04:12,225 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:12,320 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2025-02-06 12:04:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:04:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:04:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:12,322 INFO L225 Difference]: With dead ends: 142 [2025-02-06 12:04:12,322 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 12:04:12,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:04:12,323 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 68 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:12,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 155 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 12:04:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 12:04:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 135 states have internal predecessors, (152), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 161 transitions. [2025-02-06 12:04:12,326 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 161 transitions. Word has length 47 [2025-02-06 12:04:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:12,326 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 161 transitions. [2025-02-06 12:04:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 161 transitions. [2025-02-06 12:04:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 12:04:12,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:12,327 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:12,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:04:12,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1196152029, now seen corresponding path program 1 times [2025-02-06 12:04:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594686963] [2025-02-06 12:04:12,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:12,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 12:04:12,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 12:04:12,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:12,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594686963] [2025-02-06 12:04:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594686963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830301186] [2025-02-06 12:04:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:12,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:04:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:04:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:12,627 INFO L87 Difference]: Start difference. First operand 142 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:12,687 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2025-02-06 12:04:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-06 12:04:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:12,688 INFO L225 Difference]: With dead ends: 147 [2025-02-06 12:04:12,688 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 12:04:12,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:04:12,689 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 104 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:12,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 380 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 12:04:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2025-02-06 12:04:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.385321100917431) internal successors, (151), 135 states have internal predecessors, (151), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2025-02-06 12:04:12,692 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 47 [2025-02-06 12:04:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:12,692 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2025-02-06 12:04:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2025-02-06 12:04:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:04:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:12,693 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:12,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:04:12,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:12,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 806478989, now seen corresponding path program 1 times [2025-02-06 12:04:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426556990] [2025-02-06 12:04:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:12,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:04:12,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:04:12,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:12,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:12,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:12,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426556990] [2025-02-06 12:04:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426556990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:04:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21226435] [2025-02-06 12:04:12,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:12,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:12,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:12,916 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:12,971 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2025-02-06 12:04:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:04:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:12,972 INFO L225 Difference]: With dead ends: 141 [2025-02-06 12:04:12,972 INFO L226 Difference]: Without dead ends: 141 [2025-02-06 12:04:12,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:12,973 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:12,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 97 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-06 12:04:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-06 12:04:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 134 states have internal predecessors, (149), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 158 transitions. [2025-02-06 12:04:12,976 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 158 transitions. Word has length 50 [2025-02-06 12:04:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:12,976 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 158 transitions. [2025-02-06 12:04:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 158 transitions. [2025-02-06 12:04:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 12:04:12,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:12,978 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:12,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:04:12,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:12,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 806478990, now seen corresponding path program 1 times [2025-02-06 12:04:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342740197] [2025-02-06 12:04:12,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:13,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:04:13,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:04:13,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342740197] [2025-02-06 12:04:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342740197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:04:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804982987] [2025-02-06 12:04:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:04:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:13,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:04:13,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:13,822 INFO L87 Difference]: Start difference. First operand 141 states and 158 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:14,137 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2025-02-06 12:04:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:14,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-06 12:04:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:14,144 INFO L225 Difference]: With dead ends: 145 [2025-02-06 12:04:14,144 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 12:04:14,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:14,145 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 95 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:14,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 256 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:04:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 12:04:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-02-06 12:04:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 134 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2025-02-06 12:04:14,148 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 50 [2025-02-06 12:04:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:14,148 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2025-02-06 12:04:14,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2025-02-06 12:04:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:14,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:14,149 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:14,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:04:14,149 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash -231195717, now seen corresponding path program 1 times [2025-02-06 12:04:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:14,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432815588] [2025-02-06 12:04:14,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:14,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432815588] [2025-02-06 12:04:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432815588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796741425] [2025-02-06 12:04:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:14,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:14,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:14,652 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:14,831 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2025-02-06 12:04:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:14,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 12:04:14,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:14,832 INFO L225 Difference]: With dead ends: 140 [2025-02-06 12:04:14,832 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 12:04:14,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:14,834 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:14,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 369 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:14,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 12:04:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 12:04:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 133 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2025-02-06 12:04:14,846 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 53 [2025-02-06 12:04:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2025-02-06 12:04:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2025-02-06 12:04:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 12:04:14,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:14,848 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:14,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:04:14,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:14,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash -231195716, now seen corresponding path program 1 times [2025-02-06 12:04:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912219447] [2025-02-06 12:04:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:14,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:14,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 12:04:14,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 12:04:14,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:14,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912219447] [2025-02-06 12:04:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912219447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:15,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:04:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768550254] [2025-02-06 12:04:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:15,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:15,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:15,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:15,575 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:15,736 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2025-02-06 12:04:15,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:15,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-02-06 12:04:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:15,737 INFO L225 Difference]: With dead ends: 139 [2025-02-06 12:04:15,737 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 12:04:15,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:04:15,738 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:15,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 294 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:04:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 12:04:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-06 12:04:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 132 states have internal predecessors, (144), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-02-06 12:04:15,741 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 53 [2025-02-06 12:04:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-02-06 12:04:15,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-02-06 12:04:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 12:04:15,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:15,742 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:15,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:04:15,742 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:15,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1618406383, now seen corresponding path program 1 times [2025-02-06 12:04:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228572923] [2025-02-06 12:04:15,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:15,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 12:04:15,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 12:04:15,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:15,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:15,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:15,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228572923] [2025-02-06 12:04:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228572923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:15,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:15,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:04:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887564448] [2025-02-06 12:04:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:04:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:15,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:04:15,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:15,886 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:15,899 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2025-02-06 12:04:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:04:15,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-02-06 12:04:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:15,902 INFO L225 Difference]: With dead ends: 151 [2025-02-06 12:04:15,902 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 12:04:15,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:04:15,903 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:15,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 12:04:15,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2025-02-06 12:04:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 134 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-02-06 12:04:15,907 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 57 [2025-02-06 12:04:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:15,907 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-02-06 12:04:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-02-06 12:04:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:04:15,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:15,907 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:04:15,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1368763069, now seen corresponding path program 1 times [2025-02-06 12:04:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656333898] [2025-02-06 12:04:15,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:04:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:04:15,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:15,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:16,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656333898] [2025-02-06 12:04:16,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656333898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:16,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:04:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568545245] [2025-02-06 12:04:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:16,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:04:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:16,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:04:16,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:04:16,479 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:16,808 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2025-02-06 12:04:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:04:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-06 12:04:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:16,810 INFO L225 Difference]: With dead ends: 148 [2025-02-06 12:04:16,810 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 12:04:16,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:04:16,811 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 85 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:16,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 485 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:04:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 12:04:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2025-02-06 12:04:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 140 states have internal predecessors, (155), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2025-02-06 12:04:16,816 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 58 [2025-02-06 12:04:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:16,817 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2025-02-06 12:04:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2025-02-06 12:04:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-06 12:04:16,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:16,817 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:16,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:04:16,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1368763068, now seen corresponding path program 1 times [2025-02-06 12:04:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035279604] [2025-02-06 12:04:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:16,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 12:04:16,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 12:04:16,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:16,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:17,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:17,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035279604] [2025-02-06 12:04:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035279604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:04:17,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:04:17,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 12:04:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364501982] [2025-02-06 12:04:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:04:17,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:04:17,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:17,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:04:17,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:04:17,893 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:18,149 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2025-02-06 12:04:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:04:18,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-02-06 12:04:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:18,151 INFO L225 Difference]: With dead ends: 147 [2025-02-06 12:04:18,151 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 12:04:18,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:04:18,151 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 153 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:18,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 304 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:04:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 12:04:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-06 12:04:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 140 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 162 transitions. [2025-02-06 12:04:18,158 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 162 transitions. Word has length 58 [2025-02-06 12:04:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:18,158 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 162 transitions. [2025-02-06 12:04:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 162 transitions. [2025-02-06 12:04:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 12:04:18,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:18,159 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:18,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:04:18,159 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 460122656, now seen corresponding path program 1 times [2025-02-06 12:04:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334219089] [2025-02-06 12:04:18,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:18,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:04:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:04:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334219089] [2025-02-06 12:04:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334219089] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575542432] [2025-02-06 12:04:18,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:18,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:18,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:04:18,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 12:04:18,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 12:04:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:18,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:04:18,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:18,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575542432] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:18,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:04:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366102001] [2025-02-06 12:04:18,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:04:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:04:18,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:18,914 INFO L87 Difference]: Start difference. First operand 147 states and 162 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:18,945 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2025-02-06 12:04:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:04:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-06 12:04:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:18,947 INFO L225 Difference]: With dead ends: 176 [2025-02-06 12:04:18,947 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 12:04:18,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:04:18,948 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 22 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:18,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 217 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:04:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 12:04:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-02-06 12:04:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 141 states have (on average 1.326241134751773) internal successors, (187), 164 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2025-02-06 12:04:18,954 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 62 [2025-02-06 12:04:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:18,955 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2025-02-06 12:04:18,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2025-02-06 12:04:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:04:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:18,955 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:18,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:04:19,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 12:04:19,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1379147058, now seen corresponding path program 1 times [2025-02-06 12:04:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:19,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375776448] [2025-02-06 12:04:19,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:19,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:19,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:19,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:19,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375776448] [2025-02-06 12:04:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375776448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606174923] [2025-02-06 12:04:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:20,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:20,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:20,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:04:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:20,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:20,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:20,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 12:04:20,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:04:20,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:04:20,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:04:20,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:04:20,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2025-02-06 12:04:20,685 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:20,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:04:20,738 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:20,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-02-06 12:04:20,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:04:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 12:04:20,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:20,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2615) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-02-06 12:04:20,852 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-02-06 12:04:20,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2025-02-06 12:04:20,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2614 (Array Int Int))) (= (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2614))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2615)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem164#1.base|)) is different from false [2025-02-06 12:04:20,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2614 (Array Int Int)) (v_ArrVal_2613 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2613)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_2614))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2615)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2025-02-06 12:04:20,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:04:20,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 80 [2025-02-06 12:04:20,949 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 3389 treesize of output 2301 [2025-02-06 12:04:20,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 102 [2025-02-06 12:04:20,976 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 48 treesize of output 30 [2025-02-06 12:04:20,980 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 84 treesize of output 66 [2025-02-06 12:04:21,052 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:04:21,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:04:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2025-02-06 12:04:21,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606174923] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:04:21,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:04:21,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-02-06 12:04:21,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743787592] [2025-02-06 12:04:21,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:04:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:04:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:04:21,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:04:21,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=12, NotChecked=108, Total=462 [2025-02-06 12:04:21,067 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:04:21,376 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2025-02-06 12:04:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:04:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 12:04:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:04:21,377 INFO L225 Difference]: With dead ends: 170 [2025-02-06 12:04:21,377 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 12:04:21,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=12, NotChecked=132, Total=650 [2025-02-06 12:04:21,379 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 206 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:04:21,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 520 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 317 Invalid, 0 Unknown, 266 Unchecked, 0.2s Time] [2025-02-06 12:04:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 12:04:21,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-06 12:04:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 163 states have internal predecessors, (181), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:04:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2025-02-06 12:04:21,384 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 63 [2025-02-06 12:04:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:04:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2025-02-06 12:04:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:04:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2025-02-06 12:04:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 12:04:21,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:04:21,385 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:04:21,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 12:04:21,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-06 12:04:21,585 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:04:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:04:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1379147059, now seen corresponding path program 1 times [2025-02-06 12:04:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:04:21,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182926439] [2025-02-06 12:04:21,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:04:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:21,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:21,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:21,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:22,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:04:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182926439] [2025-02-06 12:04:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182926439] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:04:22,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114886879] [2025-02-06 12:04:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:04:22,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:04:22,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:04:22,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:04:22,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:04:23,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 12:04:23,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 12:04:23,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:04:23,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:04:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:04:23,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:04:23,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:04:23,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:04:23,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:04:23,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:04:23,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:04:23,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:04:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:04:23,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:04:23,483 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:23,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:04:23,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:04:23,576 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:04:23,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:04:23,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:04:23,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:04:23,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 12:04:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:04:23,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:04:23,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2899 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:04:23,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2899 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2025-02-06 12:04:23,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_2899 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int))) (<= (+ 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:04:23,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2897) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2898) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((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| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2898))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2897) .cse1 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2025-02-06 12:04:23,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2898))) (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_2897) .cse1 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2897) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2898) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2025-02-06 12:04:23,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((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 ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2895))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2898))) (let ((.cse1 (select (select .cse3 |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_2896) .cse0 v_ArrVal_2897) .cse1 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((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))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2895))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2896) .cse5 v_ArrVal_2897) (select (select (store .cse6 .cse5 v_ArrVal_2898) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2899))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) is different from false [2025-02-06 12:04:23,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:04:23,895 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 209 treesize of output 210 [2025-02-06 12:04:23,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:04:23,907 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 197 treesize of output 126 [2025-02-06 12:04:23,924 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 140554 treesize of output 118898 [2025-02-06 12:04:24,745 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 72631 treesize of output 69935 [2025-02-06 12:04:25,409 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 14239 treesize of output 13231 [2025-02-06 12:04:25,478 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 13231 treesize of output 12559 [2025-02-06 12:04:25,528 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 12559 treesize of output 10231 [2025-02-06 12:04:25,581 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 10231 treesize of output 9559 [2025-02-06 12:04:25,640 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 9559 treesize of output 8005 [2025-02-06 12:04:25,725 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 8005 treesize of output 7669 [2025-02-06 12:05:04,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:04,979 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 106 treesize of output 107 [2025-02-06 12:05:04,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:04,987 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 94 treesize of output 71 [2025-02-06 12:05:04,994 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:04,996 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 101 treesize of output 61 [2025-02-06 12:05:04,999 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:05,000 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-02-06 12:05:05,091 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 12:05:05,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-06 12:05:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-02-06 12:05:05,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114886879] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:05,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:05,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-02-06 12:05:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824481462] [2025-02-06 12:05:05,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:05,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 12:05:05,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:05,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 12:05:05,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=554, Unknown=6, NotChecked=318, Total=992 [2025-02-06 12:05:05,103 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:05,965 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2025-02-06 12:05:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:05:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-02-06 12:05:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:05,967 INFO L225 Difference]: With dead ends: 170 [2025-02-06 12:05:05,967 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 12:05:05,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=865, Unknown=6, NotChecked=402, Total=1482 [2025-02-06 12:05:05,968 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 226 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:05,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 866 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 712 Invalid, 0 Unknown, 595 Unchecked, 0.5s Time] [2025-02-06 12:05:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 12:05:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-06 12:05:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 163 states have internal predecessors, (179), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:05:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 188 transitions. [2025-02-06 12:05:05,974 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 188 transitions. Word has length 63 [2025-02-06 12:05:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:05,974 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 188 transitions. [2025-02-06 12:05:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 32 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2025-02-06 12:05:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 12:05:05,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:05,975 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, 1] [2025-02-06 12:05:05,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 12:05:06,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:05:06,179 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:05:06,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -800787804, now seen corresponding path program 2 times [2025-02-06 12:05:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970543789] [2025-02-06 12:05:06,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:06,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 12:05:06,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 12:05:06,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:06,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970543789] [2025-02-06 12:05:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970543789] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548742950] [2025-02-06 12:05:07,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:07,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:07,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:07,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:05:07,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-02-06 12:05:08,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 12:05:08,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:08,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:08,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 12:05:08,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:08,170 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 12:05:08,170 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-02-06 12:05:08,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:05:08,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:05:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:05:08,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:05:08,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:05:08,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:05:08,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:05:08,340 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:08,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:08,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:08,424 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:08,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:08,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:08,515 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:08,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 74 treesize of output 69 [2025-02-06 12:05:08,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:08,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:05:08,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 12:05:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:08,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:08,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:05:08,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:05:08,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-02-06 12:05:08,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3197))) (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~mem165#1.base| v_ArrVal_3198) .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3198) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2))))) is different from false [2025-02-06 12:05:08,930 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3196 (Array Int Int)) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= 0 (+ 2 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3196))) (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~mem164#1.base| v_ArrVal_3195) .cse0 v_ArrVal_3198) (select (select (store .cse1 .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3200))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3196 (Array Int Int)) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3196))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_3197))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3195) .cse3 v_ArrVal_3198) .cse4 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-02-06 12:05:09,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3196 (Array Int Int)) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3194))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3196))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3197))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3193) .cse0 v_ArrVal_3195) .cse1 v_ArrVal_3198) .cse2 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3196 (Array Int Int)) (v_ArrVal_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3200 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3194))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3196))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3193) .cse7 v_ArrVal_3195) .cse8 v_ArrVal_3198) (select (select (store .cse9 .cse8 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3200))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))))) is different from false [2025-02-06 12:05:09,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2025-02-06 12:05:09,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:09,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2025-02-06 12:05:09,569 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 420178 treesize of output 363306 [2025-02-06 12:05:09,723 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 35952 treesize of output 35424 [2025-02-06 12:05:09,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 736 treesize of output 604 [2025-02-06 12:05:09,775 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 604 treesize of output 568 [2025-02-06 12:05:09,781 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 568 treesize of output 460 [2025-02-06 12:05:09,790 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 460 treesize of output 412 [2025-02-06 12:05:09,800 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 412 treesize of output 400 [2025-02-06 12:05:09,806 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 400 treesize of output 364 [2025-02-06 12:05:09,822 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 202 treesize of output 166 [2025-02-06 12:05:09,834 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 166 treesize of output 160 [2025-02-06 12:05:09,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:09,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2025-02-06 12:05:09,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:05:09,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2025-02-06 12:05:09,970 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 347 [2025-02-06 12:05:09,980 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:09,982 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:05:09,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-02-06 12:05:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 11 not checked. [2025-02-06 12:05:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548742950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:10,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 16] total 39 [2025-02-06 12:05:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710707118] [2025-02-06 12:05:10,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 12:05:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:10,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 12:05:10,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=942, Unknown=21, NotChecked=414, Total=1560 [2025-02-06 12:05:10,250 INFO L87 Difference]: Start difference. First operand 170 states and 188 transitions. Second operand has 40 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 40 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:11,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (<= 0 (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 1)) (forall ((v_ArrVal_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1) (<= (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| .cse1))))) is different from false [2025-02-06 12:05:11,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (and (forall ((v_ArrVal_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (<= (+ .cse1 |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (<= (+ |c_ULTIMATE.start_main_#t~mem165#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem165#1.base|)) (<= 0 (+ .cse1 |c_ULTIMATE.start_main_~j~0#1|)) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem165#1.offset| |c_ULTIMATE.start_main_~j~0#1|))))) is different from false [2025-02-06 12:05:11,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3200 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (<= (+ |c_ULTIMATE.start_main_#t~mem165#1.offset| |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| |c_ULTIMATE.start_main_#t~mem165#1.base|)) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem165#1.offset| |c_ULTIMATE.start_main_~j~0#1|)))) is different from false [2025-02-06 12:05:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:12,077 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2025-02-06 12:05:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 12:05:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 40 states have internal predecessors, (90), 1 states have call successors, (1), 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 68 [2025-02-06 12:05:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:12,080 INFO L225 Difference]: With dead ends: 178 [2025-02-06 12:05:12,080 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 12:05:12,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=371, Invalid=1612, Unknown=33, NotChecked=846, Total=2862 [2025-02-06 12:05:12,081 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 77 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 8 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:12,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1407 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 759 Invalid, 36 Unknown, 534 Unchecked, 0.9s Time] [2025-02-06 12:05:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 12:05:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-02-06 12:05:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 149 states have (on average 1.25503355704698) internal successors, (187), 171 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:05:12,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2025-02-06 12:05:12,089 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 68 [2025-02-06 12:05:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:12,089 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2025-02-06 12:05:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 40 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2025-02-06 12:05:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 12:05:12,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:12,090 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:05:12,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:05:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:12,291 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:05:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1384935121, now seen corresponding path program 2 times [2025-02-06 12:05:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914411054] [2025-02-06 12:05:12,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:12,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 12:05:12,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:05:12,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:12,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:12,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914411054] [2025-02-06 12:05:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914411054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270565714] [2025-02-06 12:05:12,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:05:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:12,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:12,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:05:12,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-06 12:05:12,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 12:05:12,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:05:12,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:12,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:05:12,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:12,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:13,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270565714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:05:13,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:05:13,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:05:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769102123] [2025-02-06 12:05:13,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:05:13,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:05:13,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:05:13,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:05:13,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:05:13,030 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:05:13,078 INFO L93 Difference]: Finished difference Result 239 states and 263 transitions. [2025-02-06 12:05:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:05:13,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-02-06 12:05:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:05:13,079 INFO L225 Difference]: With dead ends: 239 [2025-02-06 12:05:13,079 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 12:05:13,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:05:13,080 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 31 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:05:13,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 424 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:05:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 12:05:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2025-02-06 12:05:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 201 states have (on average 1.263681592039801) internal successors, (254), 223 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 12:05:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2025-02-06 12:05:13,087 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 77 [2025-02-06 12:05:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:05:13,088 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2025-02-06 12:05:13,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:05:13,088 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2025-02-06 12:05:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 12:05:13,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:05:13,088 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, 1] [2025-02-06 12:05:13,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 12:05:13,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:13,289 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-02-06 12:05:13,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:05:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1880108429, now seen corresponding path program 3 times [2025-02-06 12:05:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:05:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370528384] [2025-02-06 12:05:13,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:05:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:05:13,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-02-06 12:05:13,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-02-06 12:05:13,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 12:05:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:05:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370528384] [2025-02-06 12:05:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370528384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:05:15,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713818827] [2025-02-06 12:05:15,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:05:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:05:15,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:05:15,333 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:05:15,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:05:15,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-02-06 12:05:20,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-02-06 12:05:20,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 12:05:20,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:05:20,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-06 12:05:20,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:05:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-02-06 12:05:20,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:05:20,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:05:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:05:20,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:05:20,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:05:20,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 12:05:20,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 12:05:20,875 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:20,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:20,963 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:20,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:20,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:21,069 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:21,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:21,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:21,172 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:21,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:21,283 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:21,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:21,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-06 12:05:21,399 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 12:05:21,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-02-06 12:05:21,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 36 treesize of output 15 [2025-02-06 12:05:21,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 12:05:21,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-06 12:05:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:05:21,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:05:21,586 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3855 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2025-02-06 12:05:21,687 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3855 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)))))) is different from false [2025-02-06 12:05:21,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3853))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3852) .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3852) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3853) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2025-02-06 12:05:21,722 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |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_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3853))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3852) .cse1 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3852) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3853) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2025-02-06 12:05:21,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3850))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_3853))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3851) .cse0 v_ArrVal_3852) .cse1 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3855 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3850))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3851) .cse5 v_ArrVal_3852) (select (select (store .cse6 .cse5 v_ArrVal_3853) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3855))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))))) is different from false [2025-02-06 12:05:23,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3848))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3850))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_3853))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3849) .cse0 v_ArrVal_3851) .cse1 v_ArrVal_3852) .cse2 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3848))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3850))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3849) .cse7 v_ArrVal_3851) .cse8 v_ArrVal_3852) (select (select (store .cse9 .cse8 v_ArrVal_3853) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3855))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4))))) is different from false