./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/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-?-551b009-m [2025-01-10 00:07:02,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:07:02,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-10 00:07:02,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:07:02,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:07:02,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:07:02,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:07:02,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:07:02,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:07:02,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:07:02,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:07:02,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:07:02,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:07:02,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:07:02,722 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:07:02,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:07:02,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:02,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:07:02,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:02,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:07:02,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:07:02,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:07:02,726 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-01-10 00:07:03,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:07:03,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:07:03,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:07:03,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:07:03,043 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:07:03,044 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-01-10 00:07:04,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76be98b01/0efd849150a64e2ebab58be314f1c5b6/FLAG68d3a7356 [2025-01-10 00:07:04,889 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:07:04,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2025-01-10 00:07:04,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76be98b01/0efd849150a64e2ebab58be314f1c5b6/FLAG68d3a7356 [2025-01-10 00:07:05,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76be98b01/0efd849150a64e2ebab58be314f1c5b6 [2025-01-10 00:07:05,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:07:05,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:07:05,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:05,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:07:05,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:07:05,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:05" (1/1) ... [2025-01-10 00:07:05,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff858a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:05, skipping insertion in model container [2025-01-10 00:07:05,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:07:05" (1/1) ... [2025-01-10 00:07:05,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:07:05,714 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,717 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,731 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,736 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,745 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,767 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,781 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:07:05,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:05,821 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:07:05,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:07:06,060 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 00:07:06,070 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:07:06,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06 WrapperNode [2025-01-10 00:07:06,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:07:06,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:06,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:07:06,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:07:06,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,205 INFO L138 Inliner]: procedures = 594, calls = 490, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 799 [2025-01-10 00:07:06,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:07:06,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:07:06,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:07:06,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:07:06,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,259 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 00:07:06,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:07:06,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:07:06,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:07:06,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:07:06,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (1/1) ... [2025-01-10 00:07:06,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:07:06,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:06,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:07:06,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:07:06,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 00:07:06,429 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 00:07:06,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 00:07:06,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 00:07:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:07:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 00:07:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2025-01-10 00:07:06,430 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2025-01-10 00:07:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 00:07:06,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 00:07:06,796 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:07:06,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:07:07,810 INFO L? ?]: Removed 349 outVars from TransFormulas that were not future-live. [2025-01-10 00:07:07,810 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:07:07,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:07:07,834 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:07:07,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:07 BoogieIcfgContainer [2025-01-10 00:07:07,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:07:07,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:07:07,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:07:07,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:07:07,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:07:05" (1/3) ... [2025-01-10 00:07:07,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112d7778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:07, skipping insertion in model container [2025-01-10 00:07:07,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:07:06" (2/3) ... [2025-01-10 00:07:07,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112d7778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:07:07, skipping insertion in model container [2025-01-10 00:07:07,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:07:07" (3/3) ... [2025-01-10 00:07:07,846 INFO L128 eAbstractionObserver]: Analyzing ICFG logname-1.i [2025-01-10 00:07:07,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:07:07,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG logname-1.i that has 4 procedures, 303 locations, 1 initial locations, 12 loop locations, and 119 error locations. [2025-01-10 00:07:07,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:07:07,927 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;@8547394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:07:07,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-01-10 00:07:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 170 states have (on average 1.9058823529411764) internal successors, (324), 289 states have internal predecessors, (324), 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-01-10 00:07:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:07,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:07,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:07,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:07,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 71563, now seen corresponding path program 1 times [2025-01-10 00:07:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245234082] [2025-01-10 00:07:07,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:08,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:08,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:08,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:08,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245234082] [2025-01-10 00:07:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245234082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809575192] [2025-01-10 00:07:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:08,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:08,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:08,754 INFO L87 Difference]: Start difference. First operand has 303 states, 170 states have (on average 1.9058823529411764) internal successors, (324), 289 states have internal predecessors, (324), 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-01-10 00:07:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:08,904 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2025-01-10 00:07:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:07:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:08,912 INFO L225 Difference]: With dead ends: 107 [2025-01-10 00:07:08,913 INFO L226 Difference]: Without dead ends: 107 [2025-01-10 00:07:08,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:08,919 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 88 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 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-01-10 00:07:08,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-10 00:07:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-01-10 00:07:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 100 states have internal predecessors, (109), 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-01-10 00:07:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2025-01-10 00:07:08,963 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 3 [2025-01-10 00:07:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:08,963 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2025-01-10 00:07:08,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2025-01-10 00:07:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 00:07:08,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:08,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 00:07:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:07:08,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 71564, now seen corresponding path program 1 times [2025-01-10 00:07:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687226140] [2025-01-10 00:07:08,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:09,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:07:09,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:07:09,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:09,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:09,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687226140] [2025-01-10 00:07:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687226140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:09,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:09,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287902920] [2025-01-10 00:07:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:09,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:09,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:09,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:09,371 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:09,505 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2025-01-10 00:07:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 00:07:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:09,507 INFO L225 Difference]: With dead ends: 106 [2025-01-10 00:07:09,507 INFO L226 Difference]: Without dead ends: 106 [2025-01-10 00:07:09,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:09,508 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 176 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-01-10 00:07:09,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 176 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-10 00:07:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-10 00:07:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 99 states have internal predecessors, (108), 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-01-10 00:07:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2025-01-10 00:07:09,526 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 3 [2025-01-10 00:07:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:09,526 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2025-01-10 00:07:09,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2025-01-10 00:07:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 00:07:09,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:09,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:07:09,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:07:09,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:09,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2131951337, now seen corresponding path program 1 times [2025-01-10 00:07:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150230808] [2025-01-10 00:07:09,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:09,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:07:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:07:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150230808] [2025-01-10 00:07:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150230808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:09,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505146135] [2025-01-10 00:07:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:07:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:09,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:07:09,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:09,991 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:10,168 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-01-10 00:07:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:07:10,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 00:07:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:10,170 INFO L225 Difference]: With dead ends: 109 [2025-01-10 00:07:10,170 INFO L226 Difference]: Without dead ends: 109 [2025-01-10 00:07:10,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:10,171 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 10 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 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.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:10,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-10 00:07:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-10 00:07:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 101 states have internal predecessors, (110), 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-01-10 00:07:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-01-10 00:07:10,182 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 6 [2025-01-10 00:07:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-01-10 00:07:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-01-10 00:07:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 00:07:10,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:10,184 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:10,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:07:10,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1014096780, now seen corresponding path program 1 times [2025-01-10 00:07:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:10,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673595273] [2025-01-10 00:07:10,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:10,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:10,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:10,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673595273] [2025-01-10 00:07:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673595273] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758711909] [2025-01-10 00:07:10,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:10,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:10,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:10,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:10,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:07:10,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:07:10,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:07:10,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:10,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:10,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 00:07:10,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:11,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:11,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-10 00:07:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:11,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758711909] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:11,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:11,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 00:07:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933009796] [2025-01-10 00:07:11,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 00:07:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:11,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 00:07:11,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-10 00:07:11,234 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:11,528 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2025-01-10 00:07:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:07:11,528 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 00:07:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:11,529 INFO L225 Difference]: With dead ends: 112 [2025-01-10 00:07:11,529 INFO L226 Difference]: Without dead ends: 112 [2025-01-10 00:07:11,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-10 00:07:11,530 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 114 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:11,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 433 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-10 00:07:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-10 00:07:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.6285714285714286) 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-01-10 00:07:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-01-10 00:07:11,539 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 9 [2025-01-10 00:07:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-01-10 00:07:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-01-10 00:07:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 00:07:11,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:11,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:11,552 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-01-10 00:07:11,744 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-01-10 00:07:11,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:11,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2137745133, now seen corresponding path program 1 times [2025-01-10 00:07:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791588772] [2025-01-10 00:07:11,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:11,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:07:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:07:11,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:11,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791588772] [2025-01-10 00:07:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791588772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979331370] [2025-01-10 00:07:12,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:12,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:12,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:12,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:12,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:07:12,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:07:12,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:07:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:12,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:07:12,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:12,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979331370] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 00:07:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849618115] [2025-01-10 00:07:12,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:12,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:07:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:07:12,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:07:12,475 INFO L87 Difference]: Start difference. First operand 112 states and 123 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-01-10 00:07:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:12,534 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2025-01-10 00:07:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:07:12,535 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-01-10 00:07:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:12,536 INFO L225 Difference]: With dead ends: 127 [2025-01-10 00:07:12,536 INFO L226 Difference]: Without dead ends: 127 [2025-01-10 00:07:12,537 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-01-10 00:07:12,537 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:12,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 553 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-10 00:07:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-10 00:07:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 120 states have internal predecessors, (129), 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-01-10 00:07:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-01-10 00:07:12,546 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 15 [2025-01-10 00:07:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:12,550 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-01-10 00:07:12,550 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-01-10 00:07:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-01-10 00:07:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:07:12,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:12,551 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:12,563 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-01-10 00:07:12,751 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-01-10 00:07:12,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:12,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash -352866264, now seen corresponding path program 2 times [2025-01-10 00:07:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:12,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372810463] [2025-01-10 00:07:12,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:12,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:07:12,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 30 statements. [2025-01-10 00:07:12,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:07:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-10 00:07:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372810463] [2025-01-10 00:07:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372810463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:13,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:13,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:07:13,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105787914] [2025-01-10 00:07:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:13,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:13,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:13,121 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:13,213 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2025-01-10 00:07:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:13,214 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-01-10 00:07:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:13,215 INFO L225 Difference]: With dead ends: 126 [2025-01-10 00:07:13,215 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 00:07:13,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:13,216 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 188 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:13,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 00:07:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-10 00:07:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 119 states have internal predecessors, (128), 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-01-10 00:07:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-01-10 00:07:13,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 30 [2025-01-10 00:07:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:13,228 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-01-10 00:07:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-01-10 00:07:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 00:07:13,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:13,231 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:13,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:07:13,231 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:13,231 INFO L85 PathProgramCache]: Analyzing trace with hash -352866263, now seen corresponding path program 1 times [2025-01-10 00:07:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486245086] [2025-01-10 00:07:13,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:13,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:13,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:07:13,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:07:13,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:13,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:13,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486245086] [2025-01-10 00:07:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486245086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000377993] [2025-01-10 00:07:13,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:13,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:13,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:07:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:07:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:07:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:14,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:14,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 00:07:14,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:14,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:07:14,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000377993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:14,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:14,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-01-10 00:07:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244418600] [2025-01-10 00:07:14,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:14,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:07:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:14,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:07:14,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:14,211 INFO L87 Difference]: Start difference. First operand 126 states and 137 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-01-10 00:07:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:14,281 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-01-10 00:07:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:07:14,281 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-01-10 00:07:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:14,283 INFO L225 Difference]: With dead ends: 132 [2025-01-10 00:07:14,283 INFO L226 Difference]: Without dead ends: 132 [2025-01-10 00:07:14,283 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-01-10 00:07:14,285 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:14,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 439 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-10 00:07:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-10 00:07:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 125 states have internal predecessors, (134), 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-01-10 00:07:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2025-01-10 00:07:14,293 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 30 [2025-01-10 00:07:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:14,293 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2025-01-10 00:07:14,293 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-01-10 00:07:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2025-01-10 00:07:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 00:07:14,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:14,294 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:14,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:07:14,498 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-01-10 00:07:14,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:14,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:14,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1554030519, now seen corresponding path program 2 times [2025-01-10 00:07:14,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:14,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771465178] [2025-01-10 00:07:14,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:14,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-10 00:07:14,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 36 statements. [2025-01-10 00:07:14,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:07:14,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771465178] [2025-01-10 00:07:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771465178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308366277] [2025-01-10 00:07:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:07:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:14,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:07:14,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:07:14,825 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:14,964 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-01-10 00:07:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:07:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-10 00:07:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:14,966 INFO L225 Difference]: With dead ends: 131 [2025-01-10 00:07:14,966 INFO L226 Difference]: Without dead ends: 131 [2025-01-10 00:07:14,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:14,967 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 188 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:14,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 62 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-10 00:07:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-10 00:07:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.4615384615384615) 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-01-10 00:07:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2025-01-10 00:07:14,977 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 36 [2025-01-10 00:07:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:14,977 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2025-01-10 00:07:14,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:07:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2025-01-10 00:07:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:07:14,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:14,978 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:14,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:07:14,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash 977773155, now seen corresponding path program 1 times [2025-01-10 00:07:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:14,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071705709] [2025-01-10 00:07:14,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:14,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:15,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:07:15,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:07:15,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:15,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071705709] [2025-01-10 00:07:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071705709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879681855] [2025-01-10 00:07:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:15,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:15,420 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:15,509 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2025-01-10 00:07:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:07:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:15,511 INFO L225 Difference]: With dead ends: 126 [2025-01-10 00:07:15,511 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 00:07:15,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:15,512 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 89 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-01-10 00:07:15,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 89 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 00:07:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-10 00:07:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 119 states have internal predecessors, (128), 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-01-10 00:07:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-01-10 00:07:15,523 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 44 [2025-01-10 00:07:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-01-10 00:07:15,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-01-10 00:07:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 00:07:15,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:15,525 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:15,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:07:15,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:15,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 977773156, now seen corresponding path program 1 times [2025-01-10 00:07:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28788913] [2025-01-10 00:07:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:15,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 00:07:15,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 00:07:15,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:15,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:16,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28788913] [2025-01-10 00:07:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28788913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:16,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190074878] [2025-01-10 00:07:16,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:16,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:16,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:16,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:16,398 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:16,495 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2025-01-10 00:07:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:16,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-01-10 00:07:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:16,497 INFO L225 Difference]: With dead ends: 126 [2025-01-10 00:07:16,497 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 00:07:16,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:16,499 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 87 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 351 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-01-10 00:07:16,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 351 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 00:07:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-01-10 00:07:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 118 states have internal predecessors, (127), 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-01-10 00:07:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2025-01-10 00:07:16,506 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 44 [2025-01-10 00:07:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:16,506 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2025-01-10 00:07:16,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2025-01-10 00:07:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:16,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:16,510 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:16,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:07:16,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash 371896997, now seen corresponding path program 1 times [2025-01-10 00:07:16,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833018944] [2025-01-10 00:07:16,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:16,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:16,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833018944] [2025-01-10 00:07:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833018944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:07:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028300073] [2025-01-10 00:07:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:17,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:17,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:17,018 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:17,251 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2025-01-10 00:07:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:07:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:17,252 INFO L225 Difference]: With dead ends: 144 [2025-01-10 00:07:17,252 INFO L226 Difference]: Without dead ends: 144 [2025-01-10 00:07:17,253 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-01-10 00:07:17,253 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 110 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:17,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 191 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-10 00:07:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2025-01-10 00:07:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 132 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-01-10 00:07:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2025-01-10 00:07:17,258 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 47 [2025-01-10 00:07:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:17,258 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2025-01-10 00:07:17,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2025-01-10 00:07:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:17,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:17,259 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:17,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:07:17,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:17,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 371898084, now seen corresponding path program 1 times [2025-01-10 00:07:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124190156] [2025-01-10 00:07:17,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:17,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:17,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:17,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124190156] [2025-01-10 00:07:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124190156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025023783] [2025-01-10 00:07:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:07:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:07:17,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:07:17,630 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:17,755 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2025-01-10 00:07:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:07:17,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:07:17,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:17,757 INFO L225 Difference]: With dead ends: 138 [2025-01-10 00:07:17,757 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 00:07:17,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:07:17,757 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 146 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-01-10 00:07:17,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 146 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 00:07:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-10 00:07:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 131 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-01-10 00:07:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2025-01-10 00:07:17,762 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 47 [2025-01-10 00:07:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:17,762 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2025-01-10 00:07:17,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2025-01-10 00:07:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 00:07:17,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:17,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:07:17,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 371898085, now seen corresponding path program 1 times [2025-01-10 00:07:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747863700] [2025-01-10 00:07:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:17,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:07:17,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:07:17,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:17,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747863700] [2025-01-10 00:07:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747863700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:18,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:07:18,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939972373] [2025-01-10 00:07:18,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:18,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:07:18,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:18,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:07:18,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:18,160 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:18,237 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2025-01-10 00:07:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-10 00:07:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:18,238 INFO L225 Difference]: With dead ends: 143 [2025-01-10 00:07:18,239 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 00:07:18,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:07:18,240 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 101 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 363 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-01-10 00:07:18,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 363 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 00:07:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2025-01-10 00:07:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4) internal successors, (147), 131 states have internal predecessors, (147), 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-01-10 00:07:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2025-01-10 00:07:18,248 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 47 [2025-01-10 00:07:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:18,250 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2025-01-10 00:07:18,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2025-01-10 00:07:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:07:18,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:18,251 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:18,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:07:18,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:18,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1832170131, now seen corresponding path program 1 times [2025-01-10 00:07:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134249708] [2025-01-10 00:07:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:18,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:07:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:07:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:18,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:18,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:18,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134249708] [2025-01-10 00:07:18,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134249708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:07:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086567081] [2025-01-10 00:07:18,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:18,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:18,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:18,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:18,611 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:18,692 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2025-01-10 00:07:18,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:18,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 00:07:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:18,694 INFO L225 Difference]: With dead ends: 137 [2025-01-10 00:07:18,694 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 00:07:18,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:18,694 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 92 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-01-10 00:07:18,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 92 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 00:07:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 00:07:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-10 00:07:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.380952380952381) internal successors, (145), 130 states have internal predecessors, (145), 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-01-10 00:07:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 154 transitions. [2025-01-10 00:07:18,702 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 154 transitions. Word has length 50 [2025-01-10 00:07:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:18,702 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 154 transitions. [2025-01-10 00:07:18,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 154 transitions. [2025-01-10 00:07:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 00:07:18,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:18,704 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:18,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:07:18,705 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1832170130, now seen corresponding path program 1 times [2025-01-10 00:07:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692322890] [2025-01-10 00:07:18,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 00:07:18,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 00:07:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:18,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692322890] [2025-01-10 00:07:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692322890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:07:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071176149] [2025-01-10 00:07:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:07:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:19,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:07:19,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:19,432 INFO L87 Difference]: Start difference. First operand 137 states and 154 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:19,711 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2025-01-10 00:07:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:07:19,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 00:07:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:19,712 INFO L225 Difference]: With dead ends: 141 [2025-01-10 00:07:19,713 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 00:07:19,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:07:19,713 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 123 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:19,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 177 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 00:07:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-01-10 00:07:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 130 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-01-10 00:07:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-01-10 00:07:19,718 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 50 [2025-01-10 00:07:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:19,718 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-01-10 00:07:19,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-01-10 00:07:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:07:19,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:19,719 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:07:19,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:19,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1735922389, now seen corresponding path program 1 times [2025-01-10 00:07:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820904211] [2025-01-10 00:07:19,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:19,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:07:19,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:07:19,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820904211] [2025-01-10 00:07:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820904211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:20,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:20,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:07:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208565056] [2025-01-10 00:07:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:20,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:07:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:20,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:07:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:20,262 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:20,448 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2025-01-10 00:07:20,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:20,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:07:20,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:20,450 INFO L225 Difference]: With dead ends: 136 [2025-01-10 00:07:20,450 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 00:07:20,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:07:20,451 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 348 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-01-10 00:07:20,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 348 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 00:07:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-10 00:07:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 129 states have internal predecessors, (142), 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-01-10 00:07:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2025-01-10 00:07:20,455 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 53 [2025-01-10 00:07:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:20,455 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2025-01-10 00:07:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2025-01-10 00:07:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 00:07:20,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:20,456 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:07:20,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1735922388, now seen corresponding path program 1 times [2025-01-10 00:07:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746585316] [2025-01-10 00:07:20,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:20,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 00:07:20,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 00:07:20,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:20,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:21,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746585316] [2025-01-10 00:07:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746585316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:21,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:07:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613846396] [2025-01-10 00:07:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:21,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:07:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:21,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:07:21,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:21,244 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:21,421 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-01-10 00:07:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-01-10 00:07:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:21,422 INFO L225 Difference]: With dead ends: 135 [2025-01-10 00:07:21,423 INFO L226 Difference]: Without dead ends: 135 [2025-01-10 00:07:21,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:07:21,423 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:21,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 294 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-10 00:07:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-01-10 00:07:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 128 states have internal predecessors, (140), 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-01-10 00:07:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-01-10 00:07:21,428 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 53 [2025-01-10 00:07:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:21,429 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-01-10 00:07:21,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-01-10 00:07:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 00:07:21,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:21,430 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:21,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:07:21,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:21,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash 188989691, now seen corresponding path program 1 times [2025-01-10 00:07:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85393762] [2025-01-10 00:07:21,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:21,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 00:07:21,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 00:07:21,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:21,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85393762] [2025-01-10 00:07:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85393762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:21,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:07:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759788745] [2025-01-10 00:07:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:07:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:21,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:07:21,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:21,609 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:21,629 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2025-01-10 00:07:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:07:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-01-10 00:07:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:21,631 INFO L225 Difference]: With dead ends: 147 [2025-01-10 00:07:21,631 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 00:07:21,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:07:21,632 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:21,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 00:07:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2025-01-10 00:07:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 130 states have internal predecessors, (142), 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-01-10 00:07:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-01-10 00:07:21,642 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 57 [2025-01-10 00:07:21,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:21,642 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-01-10 00:07:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-01-10 00:07:21,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:07:21,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:21,643 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:21,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:07:21,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:21,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1563438131, now seen corresponding path program 1 times [2025-01-10 00:07:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794426415] [2025-01-10 00:07:21,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:21,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:07:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:07:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:21,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:22,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:22,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794426415] [2025-01-10 00:07:22,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794426415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:22,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:07:22,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229757800] [2025-01-10 00:07:22,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:22,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:07:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:22,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:07:22,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:07:22,597 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:22,884 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2025-01-10 00:07:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:07:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:07:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:22,885 INFO L225 Difference]: With dead ends: 143 [2025-01-10 00:07:22,885 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 00:07:22,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:22,886 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 100 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:22,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 543 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 00:07:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 00:07:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2025-01-10 00:07:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.3272727272727274) 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-01-10 00:07:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 155 transitions. [2025-01-10 00:07:22,894 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 155 transitions. Word has length 58 [2025-01-10 00:07:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:22,895 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 155 transitions. [2025-01-10 00:07:22,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2025-01-10 00:07:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 00:07:22,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:22,895 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:22,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:07:22,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:22,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1563438132, now seen corresponding path program 1 times [2025-01-10 00:07:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:22,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369897259] [2025-01-10 00:07:22,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:22,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 00:07:23,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 00:07:23,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:23,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:24,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369897259] [2025-01-10 00:07:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369897259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:07:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:07:24,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:07:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204304534] [2025-01-10 00:07:24,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:07:24,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:07:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:24,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:07:24,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:07:24,097 INFO L87 Difference]: Start difference. First operand 140 states and 155 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:24,470 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2025-01-10 00:07:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:07:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-01-10 00:07:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:24,472 INFO L225 Difference]: With dead ends: 144 [2025-01-10 00:07:24,472 INFO L226 Difference]: Without dead ends: 144 [2025-01-10 00:07:24,472 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-01-10 00:07:24,473 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:24,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 00:07:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-10 00:07:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-01-10 00:07:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 136 states have internal predecessors, (150), 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-01-10 00:07:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2025-01-10 00:07:24,485 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 58 [2025-01-10 00:07:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2025-01-10 00:07:24,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2025-01-10 00:07:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 00:07:24,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:24,486 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:07:24,487 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1272270729, now seen corresponding path program 1 times [2025-01-10 00:07:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775523172] [2025-01-10 00:07:24,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:24,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:07:24,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:07:24,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:24,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775523172] [2025-01-10 00:07:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775523172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:24,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866438520] [2025-01-10 00:07:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:24,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:24,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:24,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:07:24,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 00:07:25,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 00:07:25,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:25,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:25,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:07:25,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:25,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866438520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:25,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 00:07:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807453371] [2025-01-10 00:07:25,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:25,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:07:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:25,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:07:25,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:25,204 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:25,236 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2025-01-10 00:07:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:07:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-01-10 00:07:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:25,239 INFO L225 Difference]: With dead ends: 173 [2025-01-10 00:07:25,239 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 00:07:25,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:07:25,240 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 20 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:25,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 392 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 00:07:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2025-01-10 00:07:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 160 states have internal predecessors, (184), 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-01-10 00:07:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2025-01-10 00:07:25,252 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 62 [2025-01-10 00:07:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:25,252 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2025-01-10 00:07:25,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2025-01-10 00:07:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:07:25,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:25,253 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:25,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:07:25,453 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-01-10 00:07:25,454 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:25,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash -785961929, now seen corresponding path program 1 times [2025-01-10 00:07:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:25,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911833359] [2025-01-10 00:07:25,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:25,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:07:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:07:25,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:25,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911833359] [2025-01-10 00:07:26,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911833359] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:26,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508763291] [2025-01-10 00:07:26,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:26,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:26,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:26,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:07:26,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:07:26,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:07:26,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:26,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:26,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 00:07:26,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:26,821 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 00:07:26,822 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 19 treesize of output 18 [2025-01-10 00:07:26,874 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 00:07:26,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 00:07:26,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:07:26,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2025-01-10 00:07:27,009 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:27,010 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 37 treesize of output 38 [2025-01-10 00:07:27,052 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:27,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-01-10 00:07:27,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-01-10 00:07:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:27,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:27,098 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-01-10 00:07:27,099 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 23 treesize of output 22 [2025-01-10 00:07:27,111 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2616) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem165#1.base|)) is different from false [2025-01-10 00:07:27,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int))) (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))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse0)))) is different from false [2025-01-10 00:07:27,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2615 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2615)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2025-01-10 00:07:27,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2616 (Array Int Int)) (v_ArrVal_2615 (Array Int Int)) (v_ArrVal_2614 (Array Int Int))) (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2614))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2615)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2025-01-10 00:07:27,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:27,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 94 [2025-01-10 00:07:27,262 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 1802 treesize of output 1378 [2025-01-10 00:07:27,275 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 76 treesize of output 52 [2025-01-10 00:07:27,277 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 52 treesize of output 40 [2025-01-10 00:07:27,282 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 22 treesize of output 16 [2025-01-10 00:07:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-01-10 00:07:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508763291] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:27,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 24 [2025-01-10 00:07:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578331192] [2025-01-10 00:07:27,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:27,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 00:07:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:27,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 00:07:27,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=343, Unknown=6, NotChecked=164, Total=600 [2025-01-10 00:07:27,422 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:27,981 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2025-01-10 00:07:27,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:07:27,982 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 00:07:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:27,983 INFO L225 Difference]: With dead ends: 166 [2025-01-10 00:07:27,983 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 00:07:27,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=467, Unknown=6, NotChecked=196, Total=812 [2025-01-10 00:07:27,985 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 87 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:27,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 641 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 437 Invalid, 0 Unknown, 335 Unchecked, 0.4s Time] [2025-01-10 00:07:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 00:07:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-10 00:07:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2919708029197081) internal successors, (177), 159 states have internal predecessors, (177), 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-01-10 00:07:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2025-01-10 00:07:27,991 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 63 [2025-01-10 00:07:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:27,992 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2025-01-10 00:07:27,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 25 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2025-01-10 00:07:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 00:07:27,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:27,993 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:07:28,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 00:07:28,197 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-01-10 00:07:28,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:28,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -785961928, now seen corresponding path program 1 times [2025-01-10 00:07:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825963172] [2025-01-10 00:07:28,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:28,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:07:28,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:07:28,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:28,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825963172] [2025-01-10 00:07:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825963172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291192983] [2025-01-10 00:07:29,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:07:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:29,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:29,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 00:07:29,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 00:07:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 00:07:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:07:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:30,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 00:07:30,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:30,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-10 00:07:30,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:07:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:07:30,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:07:30,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:07:30,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 00:07:30,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-01-10 00:07:30,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 00:07:30,297 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:30,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-01-10 00:07:30,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-10 00:07:30,417 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:30,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-01-10 00:07:30,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-10 00:07:30,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-01-10 00:07:30,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-10 00:07:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:30,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:30,590 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2025-01-10 00:07:30,611 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2901 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1)))))) is different from false [2025-01-10 00:07:30,631 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_2901 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (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-01-10 00:07:30,645 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_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2899))) (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~mem164#1.base| v_ArrVal_2898) .cse0 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2898) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2025-01-10 00:07:30,724 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_2901 (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))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2897))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2896) .cse0 v_ArrVal_2898) (select (select (store .cse1 .cse0 v_ArrVal_2899) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2901))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_2901 (Array Int Int)) (v_ArrVal_2900 (Array Int Int)) (v_ArrVal_2899 (Array Int Int)) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2896 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2897))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2899))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2896) .cse3 v_ArrVal_2898) .cse4 v_ArrVal_2901) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2900) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2025-01-10 00:07:30,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:30,753 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-01-10 00:07:30,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:30,760 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-01-10 00:07:30,774 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 68010 treesize of output 57618 [2025-01-10 00:07:31,277 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 89605 treesize of output 86685 [2025-01-10 00:07:31,592 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 6769 treesize of output 6265 [2025-01-10 00:07:31,628 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 6265 treesize of output 5929 [2025-01-10 00:07:31,664 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 5929 treesize of output 4897 [2025-01-10 00:07:31,699 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 4897 treesize of output 4561 [2025-01-10 00:07:31,734 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 4561 treesize of output 3805 [2025-01-10 00:07:31,768 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 3805 treesize of output 3637 [2025-01-10 00:07:35,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:35,051 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-01-10 00:07:35,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:35,061 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-01-10 00:07:35,064 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:35,066 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-01-10 00:07:35,070 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:35,070 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:35,071 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-01-10 00:07:35,178 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:07:35,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:07:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2025-01-10 00:07:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291192983] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:35,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:35,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2025-01-10 00:07:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698295594] [2025-01-10 00:07:35,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:35,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 00:07:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:35,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 00:07:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=599, Unknown=8, NotChecked=270, Total=992 [2025-01-10 00:07:35,191 INFO L87 Difference]: Start difference. First operand 166 states and 186 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-01-10 00:07:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:36,015 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2025-01-10 00:07:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 00:07:36,016 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-01-10 00:07:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:36,017 INFO L225 Difference]: With dead ends: 166 [2025-01-10 00:07:36,017 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 00:07:36,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=918, Unknown=8, NotChecked=340, Total=1482 [2025-01-10 00:07:36,019 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 105 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:36,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 614 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 528 Invalid, 0 Unknown, 481 Unchecked, 0.5s Time] [2025-01-10 00:07:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 00:07:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-01-10 00:07:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 159 states have internal predecessors, (175), 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-01-10 00:07:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 184 transitions. [2025-01-10 00:07:36,024 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 184 transitions. Word has length 63 [2025-01-10 00:07:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:36,024 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 184 transitions. [2025-01-10 00:07:36,024 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-01-10 00:07:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 184 transitions. [2025-01-10 00:07:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 00:07:36,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:36,025 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-01-10 00:07:36,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 00:07:36,225 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-01-10 00:07:36,226 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1180929716, now seen corresponding path program 2 times [2025-01-10 00:07:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116040984] [2025-01-10 00:07:36,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:36,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 00:07:36,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:07:36,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:07:36,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116040984] [2025-01-10 00:07:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116040984] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563388985] [2025-01-10 00:07:38,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:38,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:38,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:38,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:07:38,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 00:07:38,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-01-10 00:07:38,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 00:07:38,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:07:38,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:38,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 00:07:38,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:38,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-10 00:07:38,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:07:38,699 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:07:38,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:07:38,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:07:38,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 00:07:38,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-01-10 00:07:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-01-10 00:07:38,831 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:38,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-01-10 00:07:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-10 00:07:38,912 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:38,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-01-10 00:07:38,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-10 00:07:38,997 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 00:07:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 69 [2025-01-10 00:07:39,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-01-10 00:07:39,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-01-10 00:07:39,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-01-10 00:07:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:39,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:39,186 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_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_3199 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))))) is different from false [2025-01-10 00:07:39,196 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_3199 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3199) |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| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:07:39,207 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_3199 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:07:39,312 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_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3198) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 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_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3197))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3198) .cse2 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:07:39,335 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_3197 (Array Int Int)) (v_ArrVal_3198 (Array Int Int)) (v_ArrVal_3199 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3198) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 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_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3197))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3198) .cse2 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2025-01-10 00:07:39,359 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_3199 (Array Int Int)) (v_ArrVal_3200 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3195))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_3197))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3196) .cse0 v_ArrVal_3198) .cse1 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 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))) (<= 0 (+ 2 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem164#1.base| v_ArrVal_3195))) (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~mem164#1.base| v_ArrVal_3196) .cse5 v_ArrVal_3198) (select (select (store .cse6 .cse5 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3199))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2025-01-10 00:07:39,517 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_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3193))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_3195))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3194) .cse0 v_ArrVal_3196) .cse1 v_ArrVal_3198) (select (select (store .cse2 .cse1 v_ArrVal_3197) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_3199))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (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 ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3193))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_3195))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3197))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3194) .cse5 v_ArrVal_3196) .cse6 v_ArrVal_3198) .cse7 v_ArrVal_3199) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_3200) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2025-01-10 00:07:39,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:39,541 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-01-10 00:07:39,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:39,549 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-01-10 00:07:39,595 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 864862 treesize of output 730166 [2025-01-10 00:07:39,939 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 8950 treesize of output 8798 [2025-01-10 00:07:39,955 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 270 treesize of output 258 [2025-01-10 00:07:39,959 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 258 treesize of output 246 [2025-01-10 00:07:39,962 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 246 treesize of output 210 [2025-01-10 00:07:39,965 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 210 treesize of output 198 [2025-01-10 00:07:39,967 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 198 treesize of output 162 [2025-01-10 00:07:39,969 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 162 treesize of output 150 [2025-01-10 00:07:39,973 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 86 treesize of output 68 [2025-01-10 00:07:39,979 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 68 treesize of output 62 [2025-01-10 00:07:40,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:40,007 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-01-10 00:07:40,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:07:40,015 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-01-10 00:07:40,020 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:40,022 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-01-10 00:07:40,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:40,026 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 00:07:40,027 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-01-10 00:07:40,103 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-10 00:07:40,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-10 00:07:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 11 not checked. [2025-01-10 00:07:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563388985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:40,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2025-01-10 00:07:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626605792] [2025-01-10 00:07:40,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:40,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 00:07:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:40,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 00:07:40,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=847, Unknown=19, NotChecked=462, Total=1482 [2025-01-10 00:07:40,114 INFO L87 Difference]: Start difference. First operand 166 states and 184 transitions. Second operand has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 39 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:41,888 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2025-01-10 00:07:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 00:07:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 39 states have internal predecessors, (87), 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-01-10 00:07:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:41,890 INFO L225 Difference]: With dead ends: 182 [2025-01-10 00:07:41,890 INFO L226 Difference]: Without dead ends: 182 [2025-01-10 00:07:41,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=401, Invalid=1769, Unknown=20, NotChecked=672, Total=2862 [2025-01-10 00:07:41,892 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 227 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 29 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 797 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:41,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 716 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 725 Invalid, 13 Unknown, 797 Unchecked, 0.8s Time] [2025-01-10 00:07:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-10 00:07:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-01-10 00:07:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 153 states have (on average 1.261437908496732) internal successors, (193), 175 states have internal predecessors, (193), 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-01-10 00:07:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 202 transitions. [2025-01-10 00:07:41,897 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 202 transitions. Word has length 68 [2025-01-10 00:07:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:41,898 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 202 transitions. [2025-01-10 00:07:41,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 39 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 00:07:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 202 transitions. [2025-01-10 00:07:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 00:07:41,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:41,899 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-01-10 00:07:41,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:07:42,099 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-01-10 00:07:42,100 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:42,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1460501499, now seen corresponding path program 2 times [2025-01-10 00:07:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:42,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378364463] [2025-01-10 00:07:42,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:42,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:42,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:07:42,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:07:42,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:07:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378364463] [2025-01-10 00:07:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378364463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069612728] [2025-01-10 00:07:42,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:07:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:42,529 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-01-10 00:07:42,531 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-01-10 00:07:42,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-01-10 00:07:43,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 00:07:43,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 00:07:43,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:43,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:07:43,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:43,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069612728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:07:43,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:07:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 00:07:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970285473] [2025-01-10 00:07:43,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:07:43,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:07:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:07:43,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:07:43,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:43,153 INFO L87 Difference]: Start difference. First operand 182 states and 202 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-01-10 00:07:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 00:07:43,209 INFO L93 Difference]: Finished difference Result 235 states and 256 transitions. [2025-01-10 00:07:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:07:43,209 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-01-10 00:07:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 00:07:43,211 INFO L225 Difference]: With dead ends: 235 [2025-01-10 00:07:43,211 INFO L226 Difference]: Without dead ends: 235 [2025-01-10 00:07:43,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:07:43,212 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 24 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 00:07:43,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 591 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 00:07:43,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-01-10 00:07:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 226. [2025-01-10 00:07:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.2538071065989849) internal successors, (247), 219 states have internal predecessors, (247), 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-01-10 00:07:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 256 transitions. [2025-01-10 00:07:43,218 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 256 transitions. Word has length 77 [2025-01-10 00:07:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 00:07:43,218 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 256 transitions. [2025-01-10 00:07:43,219 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-01-10 00:07:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 256 transitions. [2025-01-10 00:07:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 00:07:43,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 00:07:43,220 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-01-10 00:07:43,235 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-01-10 00:07:43,420 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-01-10 00:07:43,420 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fflush_allErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 116 more)] === [2025-01-10 00:07:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:07:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1887918280, now seen corresponding path program 3 times [2025-01-10 00:07:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:07:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287388569] [2025-01-10 00:07:43,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:07:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:07:43,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-01-10 00:07:43,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-01-10 00:07:43,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:07:43,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:07:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287388569] [2025-01-10 00:07:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287388569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:07:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182440700] [2025-01-10 00:07:46,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:07:46,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:07:46,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:07:46,509 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-01-10 00:07:46,512 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-01-10 00:07:46,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 83 statements into 11 equivalence classes. [2025-01-10 00:07:54,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 68 of 83 statements. [2025-01-10 00:07:54,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-10 00:07:54,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:07:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-10 00:07:54,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:07:54,414 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-10 00:07:54,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-01-10 00:07:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 00:07:54,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 00:07:54,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 00:07:54,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 00:07:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 00:07:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-01-10 00:07:54,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 00:07:54,710 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:54,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:54,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:54,847 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:54,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:54,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:55,021 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:55,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:55,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:55,194 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:55,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:55,367 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:55,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:55,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:55,535 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 00:07:55,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-10 00:07:55,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 00:07:55,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-10 00:07:55,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 00:07:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 00:07:55,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:07:55,751 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)) (v_ArrVal_3856 (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_3856) |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_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_3856 (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_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2025-01-10 00:07:55,765 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_3855 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3856 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:07:55,778 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_3856 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2025-01-10 00:07:55,794 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_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem165#1.base| v_ArrVal_3854))) (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_3853) .cse0 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3856 (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_3853) (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|) .cse1) v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2025-01-10 00:07:55,821 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_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3854))) (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_3853) .cse1 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3853) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2025-01-10 00:07:55,845 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_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3853) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3854) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_3853 (Array Int Int)) (v_ArrVal_3854 (Array Int Int)) (v_ArrVal_3855 (Array Int Int)) (v_ArrVal_3856 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3854))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3853) .cse2 v_ArrVal_3856) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3855) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false